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 24, 2026 21:35Daniel MastalerzDaniel MastalerzScore: 5,476Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 21:355,39872,970,55240,824,0003,982,0002,277,376
2Feb 24, 2026 21:355,45068,179,53442,218,0003,015,0002,514,944
3Feb 24, 2026 21:355,46567,959,25442,336,0003,024,0002,318,336
4Feb 24, 2026 21:355,47672,916,73342,422,0003,030,0002,265,088
5Feb 24, 2026 21:355,50069,811,72042,609,0003,043,0002,314,240
6Feb 24, 2026 21:355,52969,109,87542,898,0002,992,0002,310,144