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 06:28Karthik 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 06:280376,915,883366,762,0001,041,0002,113,536expected "53689988847829621 ", got "2708 27 999|2598,54 2599,54 2610,53 2609,52 2596,53 2598,54 2632,53 2632,52 2611,53 2599,53 2613,53 2598,53 |2525|31 "
2Oct 2, 2026 06:280378,331,262368,243,0001,091,0002,113,536expected "53680513772981590 ", got "2718 27 999|2612,52 2608,52 2621,53 2620,51 2606,53 2605,52 2643,52 2643,52 2611,53 2610,53 2620,53 2617,51 |2539|135 "
3Oct 2, 2026 06:280377,714,827367,431,0001,144,0002,113,536expected "53688103446820221 ", got "2713 26 999|2602,53 2602,53 2617,53 2617,53 2603,54 2600,54 2641,52 2646,52 2607,53 2606,53 2608,52 2606,53 |2531|189 "