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 07:06Karthik 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 07:070379,714,515369,627,0001,035,0002,113,536expected "53690803037494995 ", got "2714 28 999|2600,53 2600,53 2606,54 2604,53 2627,53 2629,53 2600,52 2600,52 2642,54 2649,53 2701,53 2701,53 |2533|194 "
2Oct 2, 2026 07:070378,946,675368,914,0001,009,0002,113,536expected "53688613801815681 ", got "2704 26 999|2621,52 2610,51 2601,51 2602,52 2614,51 2636,52 2602,52 2597,51 2620,51 2620,50 2689,52 2691,52 |2528|200 "
3Oct 2, 2026 07:070378,892,429368,671,0001,189,0002,113,536expected "53689631615981044 ", got "2705 27 999|2600,52 2600,52 2598,52 2602,53 2629,53 2620,54 2595,52 2595,52 2634,54 2632,54 2693,53 2692,52 |2531|194 "