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 11:19Wookyung JeongWookyung JeongScore: 58,595Success
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 11:1958,588513,832,045485,277,0001,000,0002,265,088
2Sep 25, 2025 11:1958,595511,556,379484,335,0002,001,0002,285,568
3Sep 25, 2025 11:1958,627513,968,086484,610,0001,998,0002,285,568