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 25, 2026 13:00Victor MerckléVictor MerckléScore: 4,346Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 13:014,25343,742,32034,189,0001,115,0002,117,632stderr
2Aug 25, 2026 13:014,25643,669,42834,221,0001,105,0002,117,632stderr
3Aug 25, 2026 13:014,31444,217,16834,694,0001,113,0002,117,632stderr
4Aug 25, 2026 13:014,34244,455,64134,999,0001,040,0002,117,632stderr
5Aug 25, 2026 13:014,34644,468,99735,002,0001,070,0002,117,632stderr
6Aug 25, 2026 13:014,34644,473,85234,956,0001,118,0002,117,632stderr
7Aug 25, 2026 13:014,35644,546,35835,094,0001,062,0002,117,632stderr
8Aug 25, 2026 13:014,42845,186,59035,661,0001,093,0002,117,632stderr
9Aug 25, 2026 13:014,66047,087,19237,621,0001,059,0002,117,632stderr