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 19, 2026 17:10Adam FolwarcznyAdam FolwarcznyScore: 21,925Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 19, 2026 17:1021,302186,586,450175,613,0001,200,0002,113,536
2Jul 19, 2026 17:1021,306186,663,587175,836,0001,005,0002,113,536
3Jul 19, 2026 17:1021,353187,500,538176,233,0001,004,0002,113,536
4Jul 19, 2026 17:1021,353187,055,852176,041,0001,194,0002,113,536
5Jul 19, 2026 17:1021,925191,764,198180,979,0001,003,0002,113,536
6Jul 19, 2026 17:1021,927191,835,214180,986,0001,009,0002,113,536
7Jul 19, 2026 17:1021,927191,723,582180,792,0001,206,0002,113,536
8Jul 19, 2026 17:1021,988192,958,834181,497,0001,006,0002,113,536
9Jul 19, 2026 17:1022,291195,514,779184,014,0001,006,0002,113,536