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 18, 2026 19:14Adam FolwarcznyAdam FolwarcznyScore: 60,654Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 19:1460,427512,157,853499,473,0002,072,0002,113,536
2Jul 18, 2026 19:1460,465511,632,582500,860,0001,004,0002,113,536
3Jul 18, 2026 19:1460,547515,390,814500,524,0002,022,0002,113,536
4Jul 18, 2026 19:1460,652513,901,121501,393,0002,026,0002,113,536
5Jul 18, 2026 19:1460,654513,995,189501,431,0002,005,0002,113,536
6Jul 18, 2026 19:1460,680514,107,679501,522,0002,122,0002,113,536
7Jul 18, 2026 19:1460,766514,241,845502,308,0002,053,0002,113,536
8Jul 18, 2026 19:1460,774514,303,394503,427,0001,004,0002,113,536
9Jul 18, 2026 19:1460,886515,252,194504,358,0001,001,0002,113,536