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 listOct 24, 2025 10:59Priyanshu GuptaPriyanshu GuptaScore: 84,191Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 24, 2025 10:5984,188726,813,815642,783,00055,981,0002,289,664
2Oct 24, 2025 10:5984,191725,129,072647,801,00050,984,0002,289,664
3Oct 24, 2025 10:5984,210724,277,574646,944,00051,995,0002,281,472