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 listJan 7, 2026 20:41Dmitry YudakovDmitry YudakovScore: 75,944Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 7, 2026 20:4175,896653,903,904628,936,000999,0002,539,520
2Jan 7, 2026 20:4175,903656,650,470627,994,0001,999,0002,297,856
3Jan 7, 2026 20:4175,912656,344,474629,073,0001,000,0002,519,040
4Jan 7, 2026 20:4175,920656,230,222627,132,0003,000,0002,519,040
5Jan 7, 2026 20:4175,944659,493,406629,339,0001,000,0002,293,760
6Jan 7, 2026 20:4175,946660,942,323628,349,0002,001,0002,510,848
7Jan 7, 2026 20:4175,963660,817,554628,498,0001,998,0002,293,760
8Jan 7, 2026 20:4175,967656,922,170629,531,000999,0002,527,232
9Jan 7, 2026 20:4176,090661,574,658629,550,0001,998,0002,514,944