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 14, 2026 12:11Victor MerckléVictor MerckléScore: 51,729Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 12:1451,151435,073,019423,519,0001,039,0002,117,632stderr
2Sep 14, 2026 12:1451,583438,595,278427,133,0001,006,0002,117,632stderr
3Sep 14, 2026 12:1451,590438,689,562427,015,0001,186,0002,117,632stderr
4Sep 14, 2026 12:1451,592438,113,713427,201,0001,013,0002,117,632stderr
5Sep 14, 2026 12:1451,729439,716,971428,292,0001,060,0002,117,632stderr
6Sep 14, 2026 12:1451,806439,976,640428,815,0001,176,0002,117,632stderr
7Sep 14, 2026 12:1451,811440,500,314429,029,0001,006,0002,117,632stderr
8Sep 14, 2026 12:1451,812439,962,928429,029,0001,015,0002,117,632stderr
9Sep 14, 2026 12:1451,914442,103,877429,870,0001,018,0002,117,632stderr