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 listMay 4, 2026 14:03limanjun99limanjun99Score: 4,445Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 14:034,38454,315,40633,107,0003,286,0002,502,656
2May 4, 2026 14:034,39555,569,76333,234,0003,246,0002,502,656
3May 4, 2026 14:034,40351,105,49833,263,0003,285,0002,498,560
4May 4, 2026 14:034,42851,916,52634,484,0002,273,0002,494,464
5May 4, 2026 14:034,44552,561,72134,619,0002,276,0002,498,560
6May 4, 2026 14:034,44854,613,45633,561,0003,360,0002,502,656
7May 4, 2026 14:034,47354,314,43133,975,0003,157,0002,502,656
8May 4, 2026 14:034,49053,808,86935,003,0002,266,0002,510,848
9May 4, 2026 14:034,49855,287,49434,291,0003,049,0002,494,464