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 10:05Wookyung JeongWookyung JeongScore: 54,726Success
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 10:0554,718476,962,363453,158,0001,000,0002,387,968
2Sep 25, 2025 10:0554,726475,758,081453,225,0001,000,0002,379,776
3Sep 25, 2025 10:0554,737477,917,676454,321,00002,510,848