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:04RecursiveCatnipRecursiveCatnipScore: 156,400Success
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:04156,2941,325,253,6941,296,245,000999,0002,359,296
2Nov 30, 2025 19:04156,4001,324,475,7221,297,119,000999,0002,355,200
3Nov 30, 2025 19:04157,4621,333,526,7931,299,932,0006,999,0002,285,568