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 3, 2026 19:50Josu San MartinJosu San MartinScore: 15,755Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 19:5015,489137,940,615125,205,0003,357,0002,113,536
2Jul 3, 2026 19:5015,558138,855,409125,653,0003,484,0002,113,536
3Jul 3, 2026 19:5015,624139,028,489126,222,0003,465,0002,113,536
4Jul 3, 2026 19:5015,737139,927,240127,121,0003,497,0002,113,536
5Jul 3, 2026 19:5015,755140,115,452127,330,0003,437,0002,113,536
6Jul 3, 2026 19:5015,984141,972,489129,319,0003,350,0002,113,536
7Jul 3, 2026 19:5015,991142,021,793129,305,0003,423,0002,113,536
8Jul 3, 2026 19:5016,206143,823,544130,960,0003,558,0002,113,536
9Jul 3, 2026 19:5017,054150,950,478137,937,0003,616,0002,113,536