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 listNov 8, 2025 23:13izotoffizotoffScore: 61,302Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 8, 2025 23:1361,280534,554,122503,629,0004,996,0002,502,656
2Nov 8, 2025 23:1361,282530,855,630505,647,0002,997,0002,543,616
3Nov 8, 2025 23:1361,294536,091,666505,746,0002,998,0002,543,616
4Nov 8, 2025 23:1361,300531,172,548506,792,0001,999,0002,510,848
5Nov 8, 2025 23:1361,302536,478,764505,807,0002,998,0002,502,656
6Nov 8, 2025 23:1361,303539,017,568505,820,0002,998,0002,506,752
7Nov 8, 2025 23:1361,305539,642,342505,832,0002,999,0002,342,912
8Nov 8, 2025 23:1361,319532,159,696506,951,0001,999,0002,543,616
9Nov 8, 2025 23:1361,368540,366,729508,356,0001,000,0002,543,616