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 22:04Pavel SkripkinPavel SkripkinScore: 78,635Success
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 22:0478,267672,568,313418,751,000230,863,0002,473,984
2Jan 7, 2026 22:0478,294675,158,122417,900,000231,944,0002,486,272
3Jan 7, 2026 22:0478,500676,253,351417,713,000233,839,0002,396,160
4Jan 7, 2026 22:0478,582677,322,304418,508,000233,725,0002,301,952
5Jan 7, 2026 22:0478,635675,606,839418,788,000233,881,0002,461,696
6Jan 7, 2026 22:0478,657684,200,181419,904,000232,947,0002,482,176
7Jan 7, 2026 22:0478,707678,677,536418,532,000234,737,0002,486,272
8Jan 7, 2026 22:0478,766683,839,115418,843,000234,912,0002,527,232
9Jan 7, 2026 22:0480,253695,792,015432,413,000233,683,0002,469,888