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 listSep 14, 2026 08:53Victor MerckléVictor MerckléScore: 61,237Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 08:5761,003516,796,855505,244,0001,081,0002,117,632stderr
2Sep 14, 2026 08:5761,045517,176,296505,594,0001,084,0002,117,632stderr
3Sep 14, 2026 08:5761,112517,913,264506,173,0001,063,0002,117,632stderr
4Sep 14, 2026 08:5761,160518,216,797506,541,0001,089,0002,117,632stderr
5Sep 14, 2026 08:5761,237518,800,626507,246,0001,023,0002,117,632stderr
6Sep 14, 2026 08:5761,259518,895,172507,335,0001,120,0002,117,632stderr
7Sep 14, 2026 08:5761,316519,182,235507,876,0001,055,0002,117,632stderr
8Sep 14, 2026 08:5761,378519,872,303508,431,0001,008,0002,117,632stderr
9Sep 14, 2026 08:5761,393520,089,036508,552,0001,014,0002,117,632stderr