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 listFeb 26, 2026 15:42Genos0Genos0Score: 79,233Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 26, 2026 15:4279,215683,818,566577,545,00079,937,0002,322,432
2Feb 26, 2026 15:4279,233685,166,881577,680,00079,955,0002,318,336
3Feb 26, 2026 15:4279,265680,674,702576,914,00080,987,0002,277,376