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 6, 2026 12:58Teow Hua JunTeow Hua JunScore: 11,237Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 13:0211,204102,355,90691,793,0001,205,0002,113,536
2Jul 6, 2026 13:0211,219102,423,76391,913,0001,209,0002,113,536
3Jul 6, 2026 13:0211,219102,508,51291,901,0001,219,0002,113,536
4Jul 6, 2026 13:0211,232102,638,28192,021,0001,206,0002,113,536
5Jul 6, 2026 13:0211,237102,587,86592,054,0001,217,0002,113,536
6Jul 6, 2026 13:0211,238102,711,61192,051,0001,225,0002,113,536
7Jul 6, 2026 13:0211,245102,615,84092,121,0001,213,0002,113,536
8Jul 6, 2026 13:0211,433106,594,19293,654,0001,240,0002,113,536
9Jul 6, 2026 13:0211,443104,368,98393,769,0001,215,0002,113,536