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 21:41Daniel MastalerzDaniel MastalerzScore: 6,197Success
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 21:416,04575,653,22347,163,0003,010,0002,277,376
2Feb 23, 2026 21:416,06173,726,39446,283,0004,024,0002,347,008
3Feb 23, 2026 21:416,07374,697,60146,373,0004,032,0002,277,376
4Feb 23, 2026 21:416,19772,324,50047,400,0004,034,0002,482,176
5Feb 23, 2026 21:416,19978,855,86148,487,0002,968,0002,494,464
6Feb 23, 2026 21:416,34479,519,54347,596,0005,063,0002,494,464