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 8, 2026 11:26Alexander StanovoyAlexander StanovoyScore: 41,943Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 11:2741,215351,739,336340,886,0001,205,0002,113,536
2Jul 8, 2026 11:2741,596355,004,863344,248,0001,001,0002,113,536
3Jul 8, 2026 11:2741,666355,678,751344,813,0001,023,0002,113,536
4Jul 8, 2026 11:2741,923357,585,086346,776,0001,190,0002,113,536
5Jul 8, 2026 11:2741,943358,353,362347,126,0001,002,0002,113,536
6Jul 8, 2026 11:2742,598363,257,261352,496,0001,074,0002,113,536
7Jul 8, 2026 11:2742,600363,300,310352,309,0001,272,0002,113,536
8Jul 8, 2026 11:2742,602363,351,212352,585,0001,017,0002,113,536
9Jul 8, 2026 11:2742,670364,147,481353,153,0001,008,0002,113,536