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 08:38Wookyung JeongWookyung JeongScore: 55,180Success
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 08:3855,170488,871,615456,915,000999,0002,510,848
2Sep 25, 2025 08:3855,180482,063,140456,998,000999,0002,510,848
3Sep 25, 2025 08:3855,190481,350,860456,073,0002,000,0002,510,848