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 listFeb 18, 2026 18:47wnwnScore: 87,615Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 18:5287,201751,067,733721,767,0001,999,0002,285,568
2Feb 18, 2026 18:5287,509755,269,304726,324,00002,404,352
3Feb 18, 2026 18:4787,590755,896,354724,999,0001,999,0002,396,160
4Feb 18, 2026 18:4787,615767,226,929725,204,0002,000,0002,400,256
5Feb 18, 2026 18:5287,651756,016,045725,502,0001,998,0002,281,472
6Feb 18, 2026 18:4787,770748,642,671727,487,0001,000,0002,285,568