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 12:53wnwnScore: 3,560Success
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 12:543,37845,400,09826,989,0001,056,0002,482,176
2May 9, 2026 12:543,40040,658,13927,179,0001,049,0002,490,368
3May 9, 2026 12:543,41841,110,64627,231,0001,139,0002,486,272
4May 9, 2026 12:543,51345,396,71628,093,0001,070,0002,486,272
5May 9, 2026 12:543,56044,896,82028,485,0001,064,0002,486,272
6May 9, 2026 12:543,56544,206,41328,524,0001,066,0002,494,464
7May 9, 2026 12:543,57846,004,79128,543,0001,161,0002,486,272
8May 9, 2026 12:543,58844,580,51328,689,0001,094,0002,486,272
9May 9, 2026 12:543,59346,304,41028,744,0001,082,0002,490,368