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 2, 2026 00:07Victor MerckléVictor MerckléScore: 5,043Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 00:085,02749,439,94340,628,0001,097,0002,117,632stderr
2Jul 2, 2026 00:085,03749,668,21740,706,0001,109,0002,117,632stderr
3Jul 2, 2026 00:085,03853,689,47140,724,0001,098,0002,117,632stderr
4Jul 2, 2026 00:085,04251,076,70240,711,0001,140,0002,117,632stderr
5Jul 2, 2026 00:085,04349,580,42740,768,0001,094,0002,117,632stderr
6Jul 2, 2026 00:085,05849,757,95640,926,0001,057,0002,117,632stderr
7Jul 2, 2026 00:085,06349,778,70240,923,0001,104,0002,117,632stderr
8Jul 2, 2026 00:085,06649,807,10740,963,0001,089,0002,117,632stderr
9Jul 2, 2026 00:085,07249,876,86741,004,0001,100,0002,117,632stderr