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:06wnwnScore: 3,523Success
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:073,37242,741,34826,940,0001,055,0002,482,176
2May 9, 2026 14:073,37543,629,62426,950,0001,070,0002,494,464
3May 9, 2026 14:073,39244,191,05627,104,0001,051,0002,490,368
4May 9, 2026 14:073,48450,263,30027,801,0001,118,0002,486,272
5May 9, 2026 14:073,52345,291,69928,162,0001,082,0002,486,272
6May 9, 2026 14:073,54745,991,54428,355,0001,089,0002,482,176
7May 9, 2026 14:073,54948,697,25528,377,0001,084,0002,486,272
8May 9, 2026 14:073,56543,772,17228,468,0001,123,0002,482,176
9May 9, 2026 14:073,56644,507,54928,475,0001,131,0002,482,176