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 21, 2026 10:32Daniel MastalerzDaniel MastalerzScore: 5,846Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 10:325,73376,041,33745,557,0002,024,0002,326,528
2Feb 21, 2026 10:325,75974,231,20044,812,0002,987,0002,326,528
3Feb 21, 2026 10:325,76177,451,18044,830,0002,988,0002,301,952
4Feb 21, 2026 10:325,84674,266,25945,488,0003,032,0002,281,472
5Feb 21, 2026 10:325,87381,210,44644,763,0003,979,0002,519,040
6Feb 21, 2026 10:325,88277,126,56544,833,0003,985,0002,269,184