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 25, 2026 14:05Victor MerckléVictor MerckléScore: 5,563Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 14:065,39653,146,52843,694,0001,099,0002,117,632stderr
2Aug 25, 2026 14:065,44053,625,80544,071,0001,086,0002,117,632stderr
3Aug 25, 2026 14:065,45453,688,67044,198,0001,078,0002,117,632stderr
4Aug 25, 2026 14:065,47253,726,14944,337,0001,087,0002,117,632stderr
5Aug 25, 2026 14:065,56354,590,50545,077,0001,101,0002,117,632stderr
6Aug 25, 2026 14:065,57454,657,81845,238,0001,033,0002,117,632stderr
7Aug 25, 2026 14:065,59054,796,77645,336,0001,064,0002,117,632stderr
8Aug 25, 2026 14:065,60355,400,05945,446,0001,062,0002,117,632stderr
9Aug 25, 2026 14:065,64455,897,77945,727,0001,124,0002,117,632stderr