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 22:39izotoffizotoffScore: 78,233Success
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 22:3978,192671,951,236647,998,000999,0002,318,336
2Nov 8, 2025 22:3978,196671,137,014647,026,0002,000,0002,428,928
3Nov 8, 2025 22:3978,201674,039,667648,065,0001,000,0002,318,336
4Nov 8, 2025 22:3978,223671,120,641648,252,0001,000,0002,318,336
5Nov 8, 2025 22:3978,233679,391,878648,332,0001,000,0002,318,336
6Nov 8, 2025 22:3978,239680,580,362647,379,0002,001,0002,420,736
7Nov 8, 2025 22:3978,239679,505,293648,382,0001,000,0002,318,336
8Nov 8, 2025 22:3978,249680,990,642647,465,0001,998,0002,318,336
9Nov 8, 2025 22:3978,252679,175,947648,496,000999,0002,420,736