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 11:30Karthik 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 11:3101,413,855,7721,358,459,00045,912,0002,113,536expected "53685619399695368 ", got "2636 2595 2596 2598 2595 2593 2595 2592 "
2Oct 2, 2026 11:3101,412,327,6531,357,929,00045,278,0002,113,536expected "53689349195289116 ", got "2623 2586 2589 2587 2589 2587 2590 2586 "
3Oct 2, 2026 11:3101,413,588,0341,358,857,00045,616,0002,113,536expected "53692847970682115 ", got "2640 2597 2600 2596 2599 2599 2599 2596 "