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 03:37Victor MerckléVictor MerckléScore: 4,120Success
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 03:384,10042,954,62332,841,0001,189,0002,117,632stderr
2Aug 27, 2026 03:384,11344,021,04632,999,0001,144,0002,117,632stderr
3Aug 27, 2026 03:384,11642,573,06933,008,0001,161,0002,117,632stderr
4Aug 27, 2026 03:384,12042,633,02533,051,0001,151,0002,117,632stderr
5Aug 27, 2026 03:384,12042,537,05433,059,0001,144,0002,117,632stderr
6Aug 27, 2026 03:384,14742,787,85533,246,0001,182,0002,117,632stderr
7Aug 27, 2026 03:384,19743,164,20133,820,0001,018,0002,117,632stderr
8Aug 27, 2026 03:384,24743,543,76734,120,0001,132,0002,117,632stderr
9Aug 27, 2026 03:384,32544,289,92134,824,0001,076,0002,117,632stderr