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 8, 2026 18:01Mikołaj UzarskiMikołaj UzarskiScore: 880,969Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 8, 2026 18:01878,0107,317,123,1727,269,492,00017,988,0002,514,944
2Feb 8, 2026 18:01880,9697,338,580,3757,295,054,00016,990,0002,338,816
3Feb 8, 2026 18:01881,7327,351,436,7517,304,382,00013,991,0002,338,816