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 listFeb 28, 2026 23:15wnwnScore: 4,391Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 28, 2026 23:164,35856,018,67434,162,0002,009,0002,535,424
2Feb 28, 2026 23:164,36364,004,94634,199,0002,011,0002,498,560
3Feb 28, 2026 23:164,37856,563,67735,331,0001,009,0002,498,560
4Feb 28, 2026 23:164,38260,087,81035,358,0001,010,0002,490,368
5Feb 28, 2026 23:164,38754,413,42235,400,0001,011,0002,273,280
6Feb 28, 2026 23:164,38859,542,11935,406,0001,011,0002,494,464
7Feb 28, 2026 23:164,39153,804,36235,435,0001,012,0002,273,280
8Feb 28, 2026 23:164,43864,029,73435,842,000995,0002,498,560
9Feb 28, 2026 23:164,45365,499,94434,962,0001,997,0002,486,272
10Feb 28, 2026 23:164,45460,162,94634,971,0001,998,0002,535,424
11Feb 28, 2026 23:164,47060,590,57335,094,0002,005,0002,535,424
12Feb 28, 2026 23:164,87259,553,75939,426,0001,010,0002,494,464