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 10, 2026 23:28Victor MerckléVictor MerckléScore: 3,899Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2026 23:293,89040,634,32131,165,0001,122,0002,117,632stderr
2Aug 10, 2026 23:293,89240,681,75031,191,0001,113,0002,117,632stderr
3Aug 10, 2026 23:293,89740,722,04431,235,0001,117,0002,117,632stderr
4Aug 10, 2026 23:293,89840,759,34031,134,0001,220,0002,117,632stderr
5Aug 10, 2026 23:293,89940,733,50131,244,0001,120,0002,117,632stderr
6Aug 10, 2026 23:293,90441,467,62431,226,0001,184,0002,117,632stderr
7Aug 10, 2026 23:293,91040,857,21331,309,0001,150,0002,117,632stderr
8Aug 10, 2026 23:293,92340,936,61231,441,0001,123,0002,117,632stderr
9Aug 10, 2026 23:293,96541,222,79731,793,0001,123,0002,117,632stderr