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:27Karthik 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:270245,335,475235,289,0001,080,0002,113,536expected "53685981616274311 ", got "2604 2601 2631 2584 2602 2631 2583 2601 2633 "
2Oct 2, 2026 15:270244,513,167234,413,0001,128,0002,113,536expected "53692826152468704 ", got "2602 2590 2622 2575 2589 2620 2576 2592 2623 "
3Oct 2, 2026 15:270245,274,171235,008,0001,135,0002,113,536expected "53681048383391495 ", got "2600 2598 2629 2579 2597 2627 2580 2612 2629 "