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:51RecursiveCatnipRecursiveCatnipScore: 58,668Success
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:5158,644511,835,519484,745,0001,998,0002,281,472
2Nov 30, 2025 19:5158,668509,173,670485,943,000999,0002,285,568
3Nov 30, 2025 19:5159,607525,964,217492,737,0001,998,0002,465,792