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 10, 2026 12:26boop34boop34Score: 69,192Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 10, 2026 12:2669,142583,569,588572,878,0001,002,0002,113,536
2Jul 10, 2026 12:2669,151583,741,600572,954,0001,002,0002,113,536
3Jul 10, 2026 12:2669,175583,768,605573,152,0001,004,0002,113,536
4Jul 10, 2026 12:2669,183584,076,136573,222,0001,003,0002,113,536
5Jul 10, 2026 12:2669,192583,993,752573,298,0001,003,0002,113,536
6Jul 10, 2026 12:2669,249584,696,658572,696,0002,075,0002,113,536
7Jul 10, 2026 12:2669,303584,996,215573,180,0002,043,0002,113,536
8Jul 10, 2026 12:2673,967623,782,624611,924,0002,008,0002,113,536
9Jul 10, 2026 12:2674,770630,451,205618,555,0002,042,0002,113,536