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:53Adam FolwarcznyAdam FolwarcznyScore: 66,865Success
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:5366,861564,766,238553,946,0001,002,0002,113,536
2Jul 18, 2026 18:5366,862565,437,605552,947,0002,012,0002,113,536
3Jul 18, 2026 18:5366,863564,824,715553,965,0001,002,0002,113,536
4Jul 18, 2026 18:5366,864564,776,826553,974,0001,003,0002,113,536
5Jul 18, 2026 18:5366,865564,779,118552,964,0002,019,0002,113,536
6Jul 18, 2026 18:5366,873564,840,123553,018,0002,035,0002,113,536
7Jul 18, 2026 18:5366,874564,989,247553,025,0002,033,0002,113,536
8Jul 18, 2026 18:5366,902565,188,585553,277,0002,017,0002,113,536
9Jul 18, 2026 18:5366,915565,186,714554,395,0001,002,0002,113,536