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 20, 2026 19:16Ondřej PolaneckýOndřej PolaneckýScore: 8,578Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 20, 2026 19:168,55580,819,82769,857,0001,154,0002,113,536
2Jul 20, 2026 19:168,55681,483,05869,776,0001,246,0002,113,536
3Jul 20, 2026 19:168,55780,809,13969,836,0001,194,0002,113,536
4Jul 20, 2026 19:168,56280,820,13069,929,0001,143,0002,113,536
5Jul 20, 2026 19:168,57881,025,34270,005,0001,194,0002,113,536
6Jul 20, 2026 19:168,59281,033,35770,167,0001,147,0002,113,536
7Jul 20, 2026 19:168,60581,919,82370,321,0001,106,0002,113,536
8Jul 20, 2026 19:168,61581,273,46970,276,0001,233,0002,113,536
9Jul 20, 2026 19:168,67981,736,90270,890,0001,147,0002,113,536