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 7, 2026 08:37wnwnScore: 3,548Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 08:373,37443,367,00326,943,0001,065,0002,486,272
2May 7, 2026 08:373,38544,281,64927,028,0001,071,0002,494,464
3May 7, 2026 08:373,39743,458,04227,117,0001,086,0002,486,272
4May 7, 2026 08:373,42544,753,88227,341,0001,093,0002,486,272
5May 7, 2026 08:373,54843,092,26128,359,0001,094,0002,490,368
6May 7, 2026 08:373,55246,690,72028,352,0001,137,0002,482,176
7May 7, 2026 08:373,56048,181,45228,440,0001,109,0002,482,176
8May 7, 2026 08:373,56646,105,96828,499,0001,105,0002,486,272
9May 7, 2026 08:373,57546,326,94528,558,0001,118,0002,494,464