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 listJul 5, 2026 19:19Victor MerckléVictor MerckléScore: 6,729Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 19:206,72464,325,42154,708,0001,106,0002,117,632stderr
2Jul 5, 2026 19:206,72664,300,78754,806,0001,020,0002,117,632stderr
3Jul 5, 2026 19:206,72764,262,17154,742,0001,099,0002,117,632stderr
4Jul 5, 2026 19:206,72964,336,47654,820,0001,036,0002,117,632stderr
5Jul 5, 2026 19:206,72963,956,56654,757,0001,097,0002,117,632stderr
6Jul 5, 2026 19:206,73163,876,81154,838,0001,037,0002,117,632stderr
7Jul 5, 2026 19:206,73263,902,64054,784,0001,097,0002,117,632stderr
8Jul 5, 2026 19:206,74164,270,39454,860,0001,098,0002,117,632stderr
9Jul 5, 2026 19:206,76764,166,56855,146,0001,021,0002,117,632stderr