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 20, 2026 23:24Josu San MartinJosu San MartinScore: 5,772Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2026 23:255,44766,067,84743,198,0002,009,0002,490,368
2Feb 20, 2026 23:255,45070,142,82743,226,0002,010,0002,523,136
3Feb 20, 2026 23:255,69469,809,34945,253,0002,011,0002,289,664
4Feb 20, 2026 23:255,72974,551,55146,543,0001,011,0002,355,200
5Feb 20, 2026 23:245,73375,059,18247,581,00002,359,296
6Feb 20, 2026 23:255,73776,950,44546,601,0001,013,0002,359,296
7Feb 20, 2026 23:245,77275,543,54545,913,0001,996,0002,297,856
8Feb 20, 2026 23:245,77772,272,92845,951,0001,997,0002,363,392
9Feb 20, 2026 23:245,78176,938,44746,984,000999,0002,297,856
10Feb 20, 2026 23:255,79081,566,74346,051,0002,002,0002,363,392
11Feb 20, 2026 23:245,85479,501,33047,579,0001,012,0002,297,856
12Feb 20, 2026 23:245,88179,133,76447,815,000996,0002,281,472