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 listMay 13, 2026 19:09Victor MerckléVictor MerckléScore: 76,118Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 19:1076,040640,312,160630,014,0001,121,0002,117,632stderr
2May 13, 2026 19:1076,059640,660,178630,255,0001,039,0002,117,632stderr
3May 13, 2026 19:1076,064640,096,065630,193,0001,145,0002,117,632stderr
4May 13, 2026 19:1076,067639,668,100630,319,0001,039,0002,117,632stderr
5May 13, 2026 19:1076,118641,205,199630,612,0001,172,0002,117,632stderr
6May 13, 2026 19:1076,133639,476,689630,843,0001,062,0002,117,632stderr
7May 13, 2026 19:1076,149639,331,468630,914,0001,129,0002,117,632stderr
8May 13, 2026 19:1076,190639,884,962631,260,0001,125,0002,117,632stderr
9May 13, 2026 19:1076,239640,745,890631,630,0001,158,0002,117,632stderr