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 listFeb 18, 2026 11:51wnwnScore: 7,711Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 11:516,68078,666,35252,417,0003,024,0002,502,656
2Feb 18, 2026 11:516,72181,865,39052,796,0002,988,0002,281,472
3Feb 18, 2026 11:516,77378,017,72650,194,0006,023,0002,355,200
4Feb 18, 2026 11:517,71189,116,65558,001,0006,000,0002,310,144
5Feb 18, 2026 11:517,83793,031,09159,045,0006,004,0002,367,488
6Feb 18, 2026 11:517,92795,465,17960,809,0004,984,0002,351,104