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 listFeb 14, 2026 14:42Juraj ZelmanJuraj ZelmanScore: 25,600Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 14, 2026 14:4225,587235,413,427211,368,0001,001,0002,359,296
2Feb 14, 2026 14:4225,587234,948,146212,373,00002,293,760
3Feb 14, 2026 14:4225,588232,883,374211,377,0001,001,0002,293,760
4Feb 14, 2026 14:4225,589234,785,057211,390,0001,001,0002,363,392
5Feb 14, 2026 14:4225,600236,961,445211,474,0001,002,0002,293,760
6Feb 14, 2026 14:4225,603246,950,846211,506,0001,002,0002,293,760
7Feb 14, 2026 14:4225,603241,495,687212,507,00002,367,488
8Feb 14, 2026 14:4225,617247,943,653211,621,000998,0002,359,296
9Feb 14, 2026 14:4226,245244,651,715215,832,0001,998,0002,293,760