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 15, 2026 14:11Victor MerckléVictor MerckléScore: 6,968Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 14:116,95967,509,98256,718,0001,042,0002,113,536
2May 15, 2026 14:116,96365,819,01256,752,0001,043,0002,113,536
3May 15, 2026 14:116,96467,094,81656,806,0001,003,0002,113,536
4May 15, 2026 14:116,96866,594,64156,837,0001,003,0002,113,536
5May 15, 2026 14:116,96865,154,29056,839,0001,002,0002,113,536
6May 15, 2026 14:116,97165,129,63056,847,0001,017,0002,113,536
7May 15, 2026 14:117,01566,116,63257,197,0001,028,0002,113,536
8May 15, 2026 14:117,01665,572,79257,191,0001,045,0002,113,536
9May 15, 2026 14:117,11766,393,44258,060,0001,018,0002,113,536