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 4, 2026 01:13Josu San MartinJosu San MartinScore: 5,391Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 01:135,31353,413,28040,755,0003,343,0002,113,536
2Jul 4, 2026 01:135,36753,952,71441,309,0003,242,0002,113,536
3Jul 4, 2026 01:135,38054,074,00641,253,0003,405,0002,113,536
4Jul 4, 2026 01:135,38754,098,87141,275,0003,439,0002,113,536
5Jul 4, 2026 01:135,39154,046,37841,356,0003,397,0002,113,536
6Jul 4, 2026 01:135,40454,245,00541,808,0003,052,0002,113,536
7Jul 4, 2026 01:135,40954,208,56241,809,0003,086,0002,113,536
8Jul 4, 2026 01:135,43254,473,41141,902,0003,185,0002,113,536
9Jul 4, 2026 01:135,49455,043,12242,212,0003,396,0002,113,536