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 26, 2026 21:44Victor MerckléVictor MerckléScore: 3,784Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 21:453,76039,504,50530,036,0001,173,0002,113,536
2Aug 26, 2026 21:453,76939,546,27730,161,0001,124,0002,113,536
3Aug 26, 2026 21:453,77039,461,49230,170,0001,129,0002,113,536
4Aug 26, 2026 21:453,77639,634,72930,200,0001,143,0002,113,536
5Aug 26, 2026 21:453,78439,588,35430,255,0001,156,0002,113,536
6Aug 26, 2026 21:453,79239,730,72330,398,0001,082,0002,113,536
7Aug 26, 2026 21:453,81440,681,33830,532,0001,129,0002,113,536
8Aug 26, 2026 21:453,82440,046,07230,624,0001,116,0002,113,536
9Aug 26, 2026 21:453,88740,475,30331,174,0001,093,0002,113,536