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 25, 2026 01:27Maya RebholzMaya RebholzScore: 7,391Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 01:277,27769,927,33454,733,0005,670,0002,117,632
2May 25, 2026 01:277,30171,541,94854,721,0005,880,0002,113,536
3May 25, 2026 01:277,30770,084,03855,090,0005,564,0002,113,536
4May 25, 2026 01:277,33470,280,37155,251,0005,627,0002,117,632
5May 25, 2026 01:277,39173,386,44355,611,0005,737,0002,113,536
6May 25, 2026 01:277,43574,023,08756,005,0005,708,0002,117,632
7May 25, 2026 01:277,48272,947,05456,687,0005,417,0002,117,632
8May 25, 2026 01:277,48472,862,58956,537,0005,586,0002,117,632
9May 25, 2026 01:277,67473,215,03857,698,0006,002,0002,117,632