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 3, 2026 20:51Josu San MartinJosu San MartinScore: 18,691Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 20:5118,390161,972,003149,216,0003,428,0002,113,536
2Jul 3, 2026 20:5118,465162,608,720149,796,0003,466,0002,113,536
3Jul 3, 2026 20:5118,514163,040,678150,268,0003,404,0002,113,536
4Jul 3, 2026 20:5118,563163,688,993150,646,0003,428,0002,113,536
5Jul 3, 2026 20:5118,691164,459,596151,808,0003,331,0002,113,536
6Jul 3, 2026 20:5118,818165,544,619152,782,0003,411,0002,113,536
7Jul 3, 2026 20:5118,866165,904,471153,044,0003,552,0002,113,536
8Jul 3, 2026 20:5118,927166,440,145153,825,0003,273,0002,113,536
9Jul 3, 2026 20:5119,064167,571,748154,838,0003,394,0002,113,536