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 17, 2026 19:46Victor MerckléVictor MerckléScore: 47,042Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 19:4746,787396,775,561387,288,0001,047,0002,113,536
2May 17, 2026 19:4746,795399,187,946387,348,0001,053,0002,113,536
3May 17, 2026 19:4746,813401,051,209387,471,0001,085,0002,113,536
4May 17, 2026 19:4746,823396,380,017387,503,0001,132,0002,113,536
5May 17, 2026 19:4747,042399,166,374389,445,0001,006,0002,113,536
6May 17, 2026 19:4747,213401,087,049390,749,0001,123,0002,113,536
7May 17, 2026 19:4747,245399,947,560391,073,0001,062,0002,113,536
8May 17, 2026 19:4747,460404,603,002392,774,0001,150,0002,113,536
9May 17, 2026 19:4747,565402,564,371393,730,0001,063,0002,113,536