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 21, 2026 18:48Yuriy LyfenkoYuriy LyfenkoScore: 5,096Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 18:485,04659,376,60938,892,0002,991,0002,338,816
2Apr 21, 2026 18:485,05562,996,62238,963,0002,997,0002,560,000
3Apr 21, 2026 18:485,08658,873,42640,211,0002,010,0002,387,968
4Apr 21, 2026 18:485,08858,602,00639,217,0003,016,0002,555,904
5Apr 21, 2026 18:485,09666,032,19740,285,0002,014,0002,560,000
6Apr 21, 2026 18:485,09956,935,97540,311,0002,015,0002,338,816
7Apr 21, 2026 18:485,13057,911,71540,555,0002,027,0002,555,904
8Apr 21, 2026 18:485,13268,450,57040,572,0002,028,0002,551,808
9Apr 21, 2026 18:485,19360,874,13440,103,0003,007,0002,338,816