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 26, 2026 13:55wnwnScore: 3,447Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 13:553,41446,900,89527,328,0001,012,0002,326,528
2Apr 26, 2026 13:553,42546,752,67327,418,0001,015,0002,486,272
3Apr 26, 2026 13:553,43746,782,43127,510,0001,018,0002,482,176
4Apr 26, 2026 13:553,44342,335,16427,564,0001,020,0002,486,272
5Apr 26, 2026 13:553,44743,757,64327,594,0001,022,0002,486,272
6Apr 26, 2026 13:553,45346,804,62727,645,0001,023,0002,486,272
7Apr 26, 2026 13:553,46444,393,68727,726,0001,026,0002,490,368
8Apr 26, 2026 13:553,48944,022,85427,965,000998,0002,486,272
9Apr 26, 2026 13:553,64046,992,82029,212,0001,007,0002,490,368