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 15, 2026 13:36Daniel MastalerzDaniel MastalerzScore: 6,382Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 13:366,26774,665,59548,019,0004,001,0002,326,528
2Feb 15, 2026 13:366,27276,110,12648,053,0004,004,0002,273,280
3Feb 15, 2026 13:366,37773,005,30549,937,0002,996,0002,265,088
4Feb 15, 2026 13:366,38275,590,41248,970,0003,997,0002,301,952
5Feb 15, 2026 13:366,39074,238,06851,034,0002,001,0002,265,088
6Feb 15, 2026 13:366,66983,642,16851,330,0004,025,0002,265,088