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 1, 2026 07:33Genos0Genos0Score: 77,722Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 07:3477,532652,999,282577,470,00066,052,0002,113,536
2Jul 1, 2026 07:3477,624653,789,749577,747,00066,534,0002,113,536
3Jul 1, 2026 07:3477,669653,959,094577,647,00067,006,0002,113,536
4Jul 1, 2026 07:3477,683654,270,476577,599,00067,178,0002,113,536
5Jul 1, 2026 07:3477,722654,400,686578,215,00066,880,0002,113,536
6Jul 1, 2026 07:3477,819655,418,033578,584,00067,320,0002,113,536
7Jul 1, 2026 07:3478,807663,428,088583,092,00071,013,0002,113,536
8Jul 1, 2026 07:3478,831663,659,092584,144,00070,155,0002,113,536
9Jul 1, 2026 07:3478,898664,241,207584,005,00070,853,0002,113,536