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:50Wookyung JeongWookyung JeongScore: 67,101Success
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:5066,891588,744,920495,175,00060,021,0002,371,584
2Sep 25, 2025 09:5067,101581,874,742494,943,00061,992,0002,297,856
3Sep 25, 2025 09:5067,170577,345,229495,569,00061,946,0002,273,280