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 listSep 7, 2026 16:36Victor MerckléVictor MerckléScore: 4,781Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 16:384,54846,242,94031,115,0006,641,00024,576stderr
2Sep 7, 2026 16:384,55646,298,04731,246,0006,569,00024,576stderr
3Sep 7, 2026 16:384,55746,365,14031,337,0006,491,00024,576stderr
4Sep 7, 2026 16:384,61046,724,56831,150,0007,114,0002,117,632stderr
5Sep 7, 2026 16:384,78148,204,97532,677,0007,007,0002,117,632stderr
6Sep 7, 2026 16:384,81248,381,01731,233,0008,710,00024,576stderr
7Sep 7, 2026 16:384,88149,693,79733,273,0007,246,0002,117,632stderr
8Sep 7, 2026 16:384,91749,055,65432,519,0008,300,00024,576stderr
9Sep 7, 2026 16:385,08950,796,88533,947,0008,296,00024,576stderr