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 7, 2026 04:16wnwnScore: 3,410Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 04:223,29735,202,21926,336,0001,036,0002,113,536
2Jul 7, 2026 04:223,31235,606,03826,463,0001,028,0002,113,536
3Jul 7, 2026 04:223,31835,397,03226,523,0001,017,0002,113,536
4Jul 7, 2026 04:223,37135,791,87626,955,0001,028,0002,113,536
5Jul 7, 2026 04:223,41036,124,75427,278,0001,033,0002,113,536
6Jul 7, 2026 04:223,44136,386,25027,561,0001,007,0002,113,536
7Jul 7, 2026 04:223,44636,472,17027,598,0001,008,0002,113,536
8Jul 7, 2026 04:223,46837,275,92227,753,0001,035,0002,113,536
9Jul 7, 2026 04:223,47236,623,71427,805,0001,020,0002,113,536