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 16, 2026 07:54wnwnScore: 3,972Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2026 07:543,96540,839,20531,904,0001,008,0002,113,536
2Jul 16, 2026 07:543,96640,814,99631,904,0001,021,0002,113,536
3Jul 16, 2026 07:543,96842,379,77231,905,0001,035,0002,113,536
4Jul 16, 2026 07:543,97040,851,94031,948,0001,003,0002,113,536
5Jul 16, 2026 07:543,97240,891,98431,943,0001,030,0002,113,536
6Jul 16, 2026 07:543,97941,135,70032,005,0001,026,0002,113,536
7Jul 16, 2026 07:544,03141,569,99832,421,0001,043,0002,113,536
8Jul 16, 2026 07:544,03341,585,67732,473,0001,004,0002,113,536
9Jul 16, 2026 07:544,03441,628,68132,464,0001,025,0002,113,536