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 listOct 24, 2026 04:04Nao MinamiNao MinamiScore: 47,863Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 24, 2026 04:0447,833407,760,136396,017,0001,003,0002,113,536
2Oct 24, 2026 04:0447,843407,882,285396,092,0001,006,0002,113,536
3Oct 24, 2026 04:0447,845408,353,487396,115,0001,004,0002,113,536
4Oct 24, 2026 04:0447,850407,910,275396,158,0001,004,0002,113,536
5Oct 24, 2026 04:0447,863408,520,891396,263,0001,003,0002,113,536
6Oct 24, 2026 04:0447,868408,040,481396,306,0001,003,0002,113,536
7Oct 24, 2026 04:0447,868408,181,243396,307,0001,005,0002,113,536
8Oct 24, 2026 04:0447,879408,273,230396,392,0001,005,0002,113,536
9Oct 24, 2026 04:0447,902408,815,898396,584,0001,004,0002,113,536