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 12, 2026 10:19Victor MerckléVictor MerckléScore: 3,777Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 10:203,74539,458,48030,012,0001,072,0002,117,632stderr
2Aug 12, 2026 10:203,75939,601,44930,060,0001,141,0002,117,632stderr
3Aug 12, 2026 10:203,76739,697,97630,142,0001,129,0002,117,632stderr
4Aug 12, 2026 10:203,77139,653,88530,188,0001,114,0002,117,632stderr
5Aug 12, 2026 10:203,77739,718,51630,283,0001,072,0002,117,632stderr
6Aug 12, 2026 10:203,78739,861,19330,312,0001,123,0002,117,632stderr
7Aug 12, 2026 10:203,80540,047,13230,481,0001,107,0002,117,632stderr
8Aug 12, 2026 10:203,83040,121,23830,715,0001,074,0002,117,632stderr
9Aug 12, 2026 10:203,89440,714,09131,241,0001,081,0002,117,632stderr