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 7, 2026 10:09wnwnScore: 3,423Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 10:103,38642,805,86727,025,0001,086,0002,490,368
2May 7, 2026 10:103,39344,563,56527,105,0001,057,0002,490,368
3May 7, 2026 10:103,39745,971,08827,102,0001,094,0002,486,272
4May 7, 2026 10:103,39943,548,77227,147,0001,067,0002,486,272
5May 7, 2026 10:103,42344,365,04327,311,0001,100,0002,486,272
6May 7, 2026 10:103,42542,519,28727,338,0001,092,0002,482,176
7May 7, 2026 10:103,44843,513,64527,543,0001,079,0002,482,176
8May 7, 2026 10:103,52545,755,55128,182,0001,079,0002,482,176
9May 7, 2026 10:103,56446,558,69528,498,0001,086,0002,494,464