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 17, 2026 14:23Kevin HeaveyKevin HeaveyScore: 3,815Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 14:463,66940,356,31429,411,0001,046,0002,113,536
2Jul 17, 2026 14:463,67943,359,73629,492,0001,049,0002,113,536
3Jul 17, 2026 14:463,75241,025,35330,098,0001,048,0002,113,536
4Jul 17, 2026 14:463,76041,062,29630,161,0001,047,0002,113,536
5Jul 17, 2026 14:463,81541,516,01930,620,0001,045,0002,113,536
6Jul 17, 2026 14:463,81941,590,31230,657,0001,045,0002,113,536
7Jul 17, 2026 14:463,94642,905,04231,709,0001,044,0002,113,536
8Jul 17, 2026 14:463,95942,711,50831,817,0001,044,0002,113,536
9Jul 17, 2026 14:463,98952,698,69032,065,0001,047,0002,113,536