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:24wnwnScore: 3,413Success
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:243,38142,563,31227,012,0001,057,0002,486,272
2May 9, 2026 14:243,38143,261,06327,010,0001,055,0002,490,368
3May 9, 2026 14:243,38345,824,57127,034,0001,050,0002,490,368
4May 9, 2026 14:243,38842,197,57327,073,0001,050,0002,486,272
5May 9, 2026 14:243,41344,183,24327,225,0001,105,0002,478,080
6May 9, 2026 14:243,42446,371,67627,338,0001,084,0002,486,272
7May 9, 2026 14:243,56742,940,10728,571,0001,043,0002,486,272
8May 9, 2026 14:243,58246,007,08228,628,0001,106,0002,482,176
9May 9, 2026 14:243,58645,664,71128,639,0001,132,0002,486,272