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:29Victor MerckléVictor MerckléScore: 4,543Success
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:304,52445,199,64636,505,0001,051,0002,113,536
2Jun 17, 2026 21:304,53045,207,06336,569,0001,037,0002,113,536
3Jun 17, 2026 21:304,54145,310,59136,669,0001,028,0002,113,536
4Jun 17, 2026 21:304,54245,299,07936,671,0001,031,0002,113,536
5Jun 17, 2026 21:304,54345,296,99536,679,0001,036,0002,113,536
6Jun 17, 2026 21:304,55245,443,45036,756,0001,026,0002,113,536
7Jun 17, 2026 21:304,55745,465,67736,717,0001,112,0002,113,536
8Jun 17, 2026 21:304,76347,125,04938,530,0001,004,0002,113,536
9Jun 17, 2026 21:304,76647,172,31038,553,0001,010,0002,113,536