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 listJul 4, 2026 00:57Josu San MartinJosu San MartinScore: 10,181Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 00:579,96492,018,49179,365,0003,338,0002,113,536
2Jul 4, 2026 00:5710,00992,474,59979,768,0003,314,0002,113,536
3Jul 4, 2026 00:5710,12693,437,31680,693,0003,354,0002,113,536
4Jul 4, 2026 00:5710,15393,661,73280,876,0003,398,0002,113,536
5Jul 4, 2026 00:5710,18193,870,34481,122,0003,385,0002,113,536
6Jul 4, 2026 00:5710,23494,278,76381,568,0003,375,0002,113,536
7Jul 4, 2026 00:5710,23694,312,03781,466,0003,501,0002,113,536
8Jul 4, 2026 00:5710,31695,030,02882,309,0003,317,0002,113,536
9Jul 4, 2026 00:5711,292103,217,37490,314,0003,413,0002,113,536