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 listNov 30, 2025 19:06RecursiveCatnipRecursiveCatnipScore: 160,892Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 30, 2025 19:06160,7931,358,760,4311,333,586,000999,0002,359,296
2Nov 30, 2025 19:06160,8921,364,237,1661,334,407,000999,0002,367,488
3Nov 30, 2025 19:06161,0041,364,974,0641,334,332,0001,998,0002,367,488