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 20, 2026 19:23Daniel MastalerzDaniel MastalerzScore: 6,928Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2026 19:236,85284,284,42147,895,0008,980,0002,330,624
2Feb 20, 2026 19:236,86682,359,11348,988,0007,998,0002,424,832
3Feb 20, 2026 19:236,90681,740,44049,274,0008,044,0002,330,624
4Feb 20, 2026 19:236,92882,347,54451,448,0006,052,0002,310,144
5Feb 20, 2026 19:236,94290,132,90850,546,0007,076,0002,265,088
6Feb 20, 2026 19:237,06987,139,82250,720,0007,956,0002,519,040