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 listJul 18, 2026 18:33Adam FolwarcznyAdam FolwarcznyScore: 72,464Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 18:3672,442611,137,026600,273,0001,003,0002,113,536
2Jul 18, 2026 18:3672,447611,163,862600,314,0001,004,0002,113,536
3Jul 18, 2026 18:3672,447611,367,920600,315,0001,003,0002,113,536
4Jul 18, 2026 18:3672,459611,145,442600,413,0001,002,0002,113,536
5Jul 18, 2026 18:3672,464611,873,625599,451,0002,008,0002,113,536
6Jul 18, 2026 18:3672,471611,412,635600,509,0001,002,0002,113,536
7Jul 18, 2026 18:3672,471611,263,246599,504,0002,008,0002,113,536
8Jul 18, 2026 18:3672,472611,362,581600,521,0001,003,0002,113,536
9Jul 18, 2026 18:3672,482611,543,232599,527,0002,074,0002,113,536