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 listApr 27, 2026 05:47wnwnScore: 3,525Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 05:483,41945,361,17127,368,0001,013,0002,486,272
2Apr 27, 2026 05:483,45547,523,76627,657,0001,024,0002,486,272
3Apr 27, 2026 05:483,47245,587,79626,836,0001,987,0002,482,176
4Apr 27, 2026 05:483,47749,468,02226,874,0001,990,0002,482,176
5Apr 27, 2026 05:483,52549,536,26228,254,0001,009,0002,482,176
6Apr 27, 2026 05:483,59147,765,51827,826,0001,987,0002,486,272
7Apr 27, 2026 05:483,62344,567,79528,069,0002,004,0002,482,176
8Apr 27, 2026 05:483,62746,539,25628,099,0002,007,0002,478,080
9Apr 27, 2026 05:483,64550,098,59029,250,0001,008,0002,486,272