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:52wnwnScore: 3,757Success
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:533,62946,951,89129,120,0001,004,0002,498,560
2Apr 27, 2026 05:533,64945,800,57129,279,0001,009,0002,486,272
3Apr 27, 2026 05:533,66250,463,43229,382,0001,013,0002,490,368
4Apr 27, 2026 05:533,67146,493,34329,460,0001,015,0002,314,240
5Apr 27, 2026 05:533,75745,334,83730,183,0001,006,0002,551,808
6Apr 27, 2026 05:533,76246,812,76130,220,0001,007,0002,482,176
7Apr 27, 2026 05:533,77848,322,59530,351,0001,011,0002,482,176
8Apr 27, 2026 05:533,79449,196,73630,480,0001,016,0002,486,272
9Apr 27, 2026 05:533,84249,764,69330,897,000996,0002,326,528