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 13, 2025 19:23Tony SolomonikTony SolomonikScore: 115,825Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 13, 2025 19:23115,039977,752,410895,838,00058,989,0002,347,008
2Sep 13, 2025 19:23115,825985,235,970886,397,00074,949,0002,359,296
3Sep 13, 2025 19:23115,893983,772,462894,921,00066,994,0002,285,568