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 listJun 5, 2026 11:49chereshnya123chereshnya123Score: 65,903Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 11:5165,790555,239,412489,842,00056,216,0002,113,536
2Jun 5, 2026 11:5165,849555,420,747489,316,00057,234,0002,113,536
3Jun 5, 2026 11:5165,859555,652,551490,367,00056,263,0002,113,536
4Jun 5, 2026 11:5165,864555,697,397489,519,00057,156,0002,113,536
5Jun 5, 2026 11:5165,903556,172,419489,803,00057,198,0002,113,536
6Jun 5, 2026 11:5165,914556,159,895489,880,00057,210,0002,113,536
7Jun 5, 2026 11:5165,944556,380,816490,106,00057,235,0002,113,536
8Jun 5, 2026 11:5165,970556,627,923489,349,00058,204,0002,113,536
9Jun 5, 2026 11:5166,146558,089,336489,826,00059,189,0002,113,536