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 listJul 6, 2026 23:47Victor MerckléVictor MerckléScore: 4,781Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 23:494,76047,540,67138,387,0001,124,0002,117,632stderr
2Jul 6, 2026 23:494,77147,511,43138,470,0001,130,0002,117,632stderr
3Jul 6, 2026 23:494,77347,563,36738,530,0001,088,0002,117,632stderr
4Jul 6, 2026 23:494,77747,816,69338,511,0001,144,0002,117,632stderr
5Jul 6, 2026 23:494,78147,695,78938,642,0001,048,0002,117,632stderr
6Jul 6, 2026 23:494,78349,171,52738,580,0001,121,0002,117,632stderr
7Jul 6, 2026 23:494,79948,342,69738,822,0001,014,0002,117,632stderr
8Jul 6, 2026 23:494,80147,762,24738,676,0001,174,0002,117,632stderr
9Jul 6, 2026 23:494,81049,499,80138,828,0001,095,0002,117,632stderr