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 14:12wnwnScore: 3,541Success
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 14:123,37844,565,03326,978,0001,065,0002,490,368
2May 9, 2026 14:123,38344,166,83127,033,0001,051,0002,494,464
3May 9, 2026 14:123,39545,511,62427,090,0001,094,0002,486,272
4May 9, 2026 14:123,49343,522,13927,895,0001,100,0002,478,080
5May 9, 2026 14:123,54143,296,96628,322,0001,071,0002,486,272
6May 9, 2026 14:123,55444,365,35528,424,0001,078,0002,490,368
7May 9, 2026 14:123,55847,223,81228,463,0001,075,0002,486,272
8May 9, 2026 14:123,60546,974,69028,829,0001,098,0002,490,368
9May 9, 2026 14:123,61646,733,23828,905,0001,109,0002,482,176