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 listJun 17, 2026 21:43Victor MerckléVictor MerckléScore: 5,563Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 21:445,53353,536,02944,852,0001,073,0002,113,536
2Jun 17, 2026 21:445,53553,706,72644,869,0001,077,0002,113,536
3Jun 17, 2026 21:445,55353,769,11945,039,0001,053,0002,113,536
4Jun 17, 2026 21:445,55653,766,02745,051,0001,066,0002,113,536
5Jun 17, 2026 21:445,56356,136,41645,073,0001,105,0002,113,536
6Jun 17, 2026 21:445,56753,814,27345,179,0001,031,0002,113,536
7Jun 17, 2026 21:445,57353,850,98945,244,0001,015,0002,113,536
8Jun 17, 2026 21:445,82956,019,27547,378,0001,010,0002,113,536
9Jun 17, 2026 21:445,84056,108,01447,447,0001,032,0002,113,536