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 28, 2026 05:03Victor MerckléVictor MerckléScore: 7,760Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 05:047,72673,492,08962,978,0001,155,0002,113,536
2Aug 28, 2026 05:047,72872,387,94162,987,0001,157,0002,113,536
3Aug 28, 2026 05:047,74872,439,68663,183,0001,131,0002,113,536
4Aug 28, 2026 05:047,75672,521,49863,301,0001,077,0002,113,536
5Aug 28, 2026 05:047,76072,785,89363,272,0001,140,0002,113,536
6Aug 28, 2026 05:047,76672,799,76263,290,0001,175,0002,113,536
7Aug 28, 2026 05:047,82773,452,35363,780,0001,185,0002,113,536
8Aug 28, 2026 05:047,97174,492,92865,086,0001,074,0002,113,536
9Aug 28, 2026 05:048,00174,721,64465,341,0001,075,0002,113,536