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 2, 2026 15:43Karthik ReddyKarthik ReddyError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 15:430211,077,114201,078,0001,017,0002,113,536expected "53680640918637217 ", got "2562 2500 2502 2493 2502 2502 2500 2494 22 "
2Oct 2, 2026 15:430210,818,170200,792,0001,006,0002,113,536expected "53683901519503922 ", got "2565 2496 2496 2489 2499 2497 2495 2489 154 "
3Oct 2, 2026 15:430211,298,642201,351,0001,003,0002,113,536expected "53682301184280891 ", got "2567 2503 2505 2497 2505 2504 2503 2496 130 "