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 07:17Victor MerckléVictor MerckléScore: 4,208Success
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 07:184,18142,442,70933,591,0001,112,0002,117,632stderr
2Jul 2, 2026 07:184,19343,197,94333,781,0001,025,0002,117,632stderr
3Jul 2, 2026 07:184,19442,704,15533,739,0001,075,0002,117,632stderr
4Jul 2, 2026 07:184,19642,645,31833,748,0001,086,0002,117,632stderr
5Jul 2, 2026 07:184,20842,644,93633,883,0001,044,0002,117,632stderr
6Jul 2, 2026 07:184,21042,738,08633,919,0001,028,0002,117,632stderr
7Jul 2, 2026 07:184,21642,696,84033,872,0001,126,0002,117,632stderr
8Jul 2, 2026 07:184,30243,567,91534,659,0001,052,0002,117,632stderr
9Jul 2, 2026 07:184,35443,862,10435,120,0001,021,0002,117,632stderr