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 19:29Daniel MastalerzDaniel MastalerzScore: 6,566Success
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 19:296,46482,226,08650,617,0003,037,0002,334,720
2Feb 24, 2026 19:296,48380,911,29050,820,0002,989,0002,310,144
3Feb 24, 2026 19:296,56479,897,35252,467,0002,017,0002,322,432
4Feb 24, 2026 19:296,56679,218,23151,472,0003,027,0002,326,528
5Feb 24, 2026 19:296,57276,831,95052,530,0002,020,0002,326,528
6Feb 24, 2026 19:297,35288,488,65357,020,0004,001,0002,334,720