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 20, 2026 06:02M-RochatM-RochatScore: 11,975Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 06:0311,956108,609,83996,231,0003,009,0002,113,536
2May 20, 2026 06:0311,962108,718,87496,281,0003,005,0002,113,536
3May 20, 2026 06:0311,966111,522,70596,286,0003,038,0002,113,536
4May 20, 2026 06:0311,971110,415,88296,350,0003,014,0002,113,536
5May 20, 2026 06:0311,975110,060,40996,179,0003,218,0002,113,536
6May 20, 2026 06:0311,989109,636,79596,508,0003,005,0002,113,536
7May 20, 2026 06:0311,989109,024,43596,508,0003,008,0002,113,536
8May 20, 2026 06:0311,992109,571,85696,523,0003,012,0002,113,536
9May 20, 2026 06:0312,006109,604,04497,630,0002,022,0002,113,536