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 24, 2026 07:16satoru.netsatoru.netScore: 29,766Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 07:1629,755275,122,699244,969,0001,999,0002,396,160
2Feb 24, 2026 07:1629,759269,337,316245,003,0002,000,0002,404,352
3Feb 24, 2026 07:1629,761274,370,355246,019,0001,000,0002,396,160
4Feb 24, 2026 07:1629,763278,912,785245,036,0002,000,0002,269,184
5Feb 24, 2026 07:1629,766271,758,801246,058,0001,000,0002,396,160
6Feb 24, 2026 07:1629,767280,696,367246,067,0001,000,0002,277,376
7Feb 24, 2026 07:1629,771278,130,090246,102,0001,000,0002,277,376
8Feb 24, 2026 07:1629,772273,193,647246,107,0001,000,0002,510,848
9Feb 24, 2026 07:1629,775274,680,693245,131,0002,001,0002,277,376