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 listMay 16, 2026 02:33Victor MerckléVictor MerckléScore: 6,952Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 02:346,94964,970,50457,684,00002,113,536
2May 16, 2026 02:346,95064,986,06157,690,00002,113,536
3May 16, 2026 02:346,95165,050,98856,652,0001,043,0002,113,536
4May 16, 2026 02:346,95265,697,24957,706,00002,113,536
5May 16, 2026 02:346,95267,838,16857,707,00002,113,536
6May 16, 2026 02:346,95367,832,47457,717,00002,113,536
7May 16, 2026 02:346,95468,240,74756,712,0001,009,0002,113,536
8May 16, 2026 02:346,95465,053,76156,717,0001,004,0002,113,536
9May 16, 2026 02:346,95765,043,01856,702,0001,042,0002,113,536