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 11, 2026 16:38Daniel MastalerzDaniel MastalerzScore: 96,708Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 16:3896,600826,980,048798,785,0002,999,0002,326,528
2Feb 11, 2026 16:3896,708827,001,143799,677,0002,998,0002,326,528
3Feb 11, 2026 16:3896,771831,254,890801,200,0002,000,0002,314,240