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 listSep 25, 2025 21:29Daniel MastalerzDaniel MastalerzScore: 46,053Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2025 21:2946,014406,293,843379,920,0001,999,0002,273,280
2Sep 25, 2025 21:2946,053404,989,287381,242,0001,000,0002,396,160
3Sep 25, 2025 21:2946,084411,010,713381,495,0001,001,0002,273,280