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 listNov 2, 2025 03:27Tan Lip WeiTan Lip WeiScore: 40,113Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 2, 2025 03:2839,853356,576,304319,786,00010,992,0002,441,216
2Nov 2, 2025 03:2739,857361,277,365319,819,00010,993,0002,297,856
3Nov 2, 2025 03:2839,996359,245,670320,965,00010,998,0002,490,368
4Nov 2, 2025 03:2840,113362,231,043322,939,0009,998,0002,494,464
5Nov 2, 2025 03:2740,150361,982,213322,267,00010,975,0002,498,560
6Nov 2, 2025 03:2740,193366,640,177321,616,00011,985,0002,310,144