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:17Karthik 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:170243,059,635232,803,0001,136,0002,113,536expected "53688306107200305 ", got "2604 2591 2571 2572 2588 2572 2572 2590 2571 "
2Oct 2, 2026 15:170243,461,913233,501,0001,094,0002,113,536expected "53682962846832427 ", got "2601 2605 2573 2579 2603 2575 2578 2603 2574 "
3Oct 2, 2026 15:170243,408,415233,154,0001,155,0002,113,536expected "53682367159498393 ", got "2599 2595 2581 2576 2593 2576 2576 2595 2574 "