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 24, 2026 19:56Maya RebholzMaya RebholzScore: 7,596Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 19:567,52072,361,06856,766,0005,650,0002,113,536
2May 24, 2026 19:567,54574,148,52557,069,0005,557,0002,113,536
3May 24, 2026 19:567,57075,039,15457,111,0005,726,0002,113,536
4May 24, 2026 19:567,59175,010,45357,434,0005,577,0002,117,632
5May 24, 2026 19:567,59675,134,17257,500,0005,554,0002,117,632
6May 24, 2026 19:567,62873,226,07057,559,0005,757,0002,117,632
7May 24, 2026 19:567,70573,693,78858,281,0005,675,0002,113,536
8May 24, 2026 19:567,80874,375,77358,949,0005,863,0002,117,632
9May 24, 2026 19:568,08480,749,77359,149,0007,956,0002,117,632