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:34wnwnScore: 3,469Success
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:353,41043,359,12727,296,0001,010,0002,551,808
2Apr 27, 2026 05:353,43742,624,41627,516,0001,019,0002,490,368
3Apr 27, 2026 05:353,45342,138,05027,637,0001,023,0002,330,624
4Apr 27, 2026 05:353,46541,631,69426,780,0001,983,0002,330,624
5Apr 27, 2026 05:353,46947,425,30526,808,0001,985,0002,486,272
6Apr 27, 2026 05:353,47842,879,72526,882,0001,991,0002,478,080
7Apr 27, 2026 05:353,56343,022,82228,560,0001,020,0002,490,368
8Apr 27, 2026 05:353,58748,081,92628,751,0001,026,0002,486,272
9Apr 27, 2026 05:353,64846,469,84829,274,0001,009,0002,486,272