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 23, 2026 22:45Maya RebholzMaya RebholzScore: 8,342Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 23, 2026 22:458,26681,017,17463,071,0005,541,0002,117,632
2May 23, 2026 22:458,29880,312,55663,322,0005,553,0002,113,536
3May 23, 2026 22:458,30078,366,84863,326,0005,570,0002,117,632
4May 23, 2026 22:458,32881,297,41163,477,0005,648,0002,113,536
5May 23, 2026 22:458,34279,703,76863,819,0005,422,0002,113,536
6May 23, 2026 22:458,36381,478,86963,670,0005,749,0002,113,536
7May 23, 2026 22:458,36679,944,58363,914,0005,531,0002,117,632
8May 23, 2026 22:458,36880,429,37563,695,0005,766,0002,117,632
9May 23, 2026 22:458,44779,999,16664,359,0005,752,0002,117,632