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 listMay 9, 2026 13:34wnwnScore: 3,393Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 13:343,36842,745,33426,922,0001,033,0002,482,176
2May 9, 2026 13:343,36840,849,73626,927,0001,029,0002,486,272
3May 9, 2026 13:343,37242,496,15426,958,0001,035,0002,478,080
4May 9, 2026 13:343,37645,366,06026,975,0001,054,0002,490,368
5May 9, 2026 13:343,39342,652,22627,113,0001,056,0002,482,176
6May 9, 2026 13:343,40444,629,41127,192,0001,069,0002,490,368
7May 9, 2026 13:343,53046,417,73728,228,0001,078,0002,486,272
8May 9, 2026 13:343,54843,636,14128,412,0001,041,0002,478,080
9May 9, 2026 13:343,55148,118,65028,411,0001,070,0002,486,272