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 09:07Wookyung JeongWookyung JeongScore: 58,400Success
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 09:0758,394509,915,588482,675,0001,998,0002,379,776
2Sep 25, 2025 09:0758,400519,578,841482,722,0001,998,0002,379,776
3Sep 25, 2025 09:0758,426513,336,535482,933,0001,999,0002,379,776