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 9, 2026 12:20Victor MerckléVictor MerckléScore: 91,833Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 12:2190,980763,177,595754,027,0001,113,0002,117,632stderr
2Jul 9, 2026 12:2191,204765,118,549755,875,0001,122,0002,117,632stderr
3Jul 9, 2026 12:2191,775769,830,332760,644,0001,089,0002,117,632stderr
4Jul 9, 2026 12:2191,822770,809,319761,015,0001,108,0002,117,632stderr
5Jul 9, 2026 12:2191,833770,289,775761,121,0001,098,0002,117,632stderr
6Jul 9, 2026 12:2192,130772,853,754763,550,0001,129,0002,117,632stderr
7Jul 9, 2026 12:2192,310774,327,609765,076,0001,101,0002,117,632stderr
8Jul 9, 2026 12:2192,629777,006,315767,685,0001,137,0002,117,632stderr
9Jul 9, 2026 12:2194,318791,034,468781,818,0001,026,0002,117,632stderr