Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listAug 27, 2026 02:50Victor MerckléVictor MerckléScore: 4,114Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 02:514,06842,519,16032,647,0001,119,0002,117,632stderr
2Aug 27, 2026 02:514,07142,881,66532,668,0001,125,0002,117,632stderr
3Aug 27, 2026 02:514,07642,214,21932,676,0001,161,0002,117,632stderr
4Aug 27, 2026 02:514,10342,458,32132,977,0001,078,0002,117,632stderr
5Aug 27, 2026 02:514,11442,528,66732,974,0001,178,0002,117,632stderr
6Aug 27, 2026 02:514,11842,566,89633,069,0001,112,0002,117,632stderr
7Aug 27, 2026 02:514,13342,763,69633,136,0001,175,0002,117,632stderr
8Aug 27, 2026 02:514,14242,735,36933,268,0001,116,0002,117,632stderr
9Aug 27, 2026 02:514,15843,368,25633,368,0001,147,0002,117,632stderr