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 23, 2026 15:22satoru.netsatoru.netScore: 40,712Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2026 15:2240,656367,955,781336,441,0001,001,0002,383,872
2Feb 23, 2026 15:2240,701365,726,772336,823,000999,0002,277,376
3Feb 23, 2026 15:2240,706364,383,152336,863,000999,0002,277,376
4Feb 23, 2026 15:2240,710365,584,521335,893,0001,999,0002,396,160
5Feb 23, 2026 15:2240,712365,540,917335,914,0001,999,0002,277,376
6Feb 23, 2026 15:2240,713365,815,212336,922,000999,0002,400,256
7Feb 23, 2026 15:2240,723367,379,793336,002,0002,000,0002,277,376
8Feb 23, 2026 15:2240,730366,362,679337,062,0001,000,0002,396,160
9Feb 23, 2026 15:2240,761366,590,245336,324,0001,995,0002,277,376