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 17, 2026 21:26wnwnScore: 11,065Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2026 21:2611,013122,451,56690,407,0001,004,0002,289,664
2Feb 17, 2026 21:2611,019116,206,91990,450,0001,005,0002,269,184
3Feb 17, 2026 21:2611,037117,726,31090,599,0001,006,0002,392,064
4Feb 17, 2026 21:2611,065115,975,96989,843,0001,996,0002,523,136
5Feb 17, 2026 21:2611,080115,855,23289,963,0001,999,0002,273,280
6Feb 17, 2026 21:2611,083118,844,49589,991,0001,999,0002,293,760