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 22:27Victor MerckléVictor MerckléScore: 3,833Success
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 22:283,78539,865,13630,300,0001,121,0002,117,632stderr
2Aug 12, 2026 22:283,79339,923,80930,361,0001,125,0002,117,632stderr
3Aug 12, 2026 22:283,79739,959,59930,399,0001,124,0002,117,632stderr
4Aug 12, 2026 22:283,80439,993,63730,451,0001,123,0002,117,632stderr
5Aug 12, 2026 22:283,83340,203,84830,566,0001,250,0002,117,632stderr
6Aug 12, 2026 22:283,84440,315,10130,770,0001,140,0002,117,632stderr
7Aug 12, 2026 22:283,88940,695,84031,186,0001,093,0002,117,632stderr
8Aug 12, 2026 22:283,96041,288,10931,743,0001,128,0002,117,632stderr
9Aug 12, 2026 22:284,02941,867,27732,332,0001,111,0002,117,632stderr