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 27, 2026 15:44SabadonSabadonScore: 98,611Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 15:4497,913844,249,037746,707,00065,974,0002,326,528
2Mar 27, 2026 15:4497,988847,779,814760,350,00052,954,0002,326,528
3Mar 27, 2026 15:4498,162840,346,512759,759,00054,982,0002,367,488
4Mar 27, 2026 15:4498,602845,414,802761,440,00056,958,0002,326,528
5Mar 27, 2026 15:4498,611850,646,340752,515,00065,957,0002,326,528
6Mar 27, 2026 15:4498,845847,712,254760,458,00059,957,0002,367,488
7Mar 27, 2026 15:4498,966848,231,576769,456,00051,963,0002,326,528
8Mar 27, 2026 15:4499,037852,904,303767,003,00055,000,0002,326,528
9Mar 27, 2026 15:4499,249850,434,098765,784,00057,983,0002,326,528