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 listMar 15, 2026 16:03shartgepettoshartgepettoScore: 11,504Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 16:0311,187121,349,84287,860,0004,992,0002,465,792
2Mar 15, 2026 16:0311,337121,958,04989,091,0005,005,0002,441,216
3Mar 15, 2026 16:0311,428120,842,33989,863,0004,992,0002,490,368
4Mar 15, 2026 16:0311,439121,462,39189,945,0004,996,0002,482,176
5Mar 15, 2026 16:0311,504118,845,37990,462,0005,025,0002,404,352
6Mar 15, 2026 16:0311,553121,303,02389,895,0005,993,0002,461,696
7Mar 15, 2026 16:0311,660117,808,02293,784,0002,993,0002,453,504
8Mar 15, 2026 16:0311,737122,133,60994,407,0003,013,0002,465,792
9Mar 15, 2026 16:0311,789124,235,87294,824,0003,026,0002,478,080