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 listFeb 26, 2026 21:35Mikołaj UzarskiMikołaj UzarskiScore: 5,520Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 26, 2026 21:355,50972,076,47839,760,0005,964,0002,469,888
2Feb 26, 2026 21:355,52076,269,00040,840,0004,980,0002,293,760
3Feb 26, 2026 21:355,55970,081,99541,127,0005,015,0002,428,928