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:41Daniel MastalerzDaniel MastalerzScore: 6,166Success
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:416,09077,141,76243,470,0007,076,0002,334,720
2Feb 24, 2026 19:416,12381,874,28743,849,0006,976,0002,502,656
3Feb 24, 2026 19:416,16676,247,38144,155,0007,024,0002,482,176
4Feb 24, 2026 19:416,16674,090,41244,155,0007,024,0002,314,240
5Feb 24, 2026 19:416,19376,492,95744,350,0007,055,0002,301,952
6Feb 24, 2026 19:416,19875,255,20344,382,0007,060,0002,482,176