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 listMay 13, 2026 16:25Victor MerckléVictor MerckléScore: 7,884Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 16:267,88275,723,71664,409,0001,015,0002,113,536
2May 13, 2026 16:267,88375,700,96764,382,0001,047,0002,113,536
3May 13, 2026 16:267,88373,455,27664,437,0001,000,0002,113,536
4May 13, 2026 16:267,88375,948,63664,410,0001,026,0002,113,536
5May 13, 2026 16:267,88474,374,90664,441,0001,004,0002,113,536
6May 13, 2026 16:267,88572,843,27364,433,0001,013,0002,113,536
7May 13, 2026 16:267,89673,432,60764,512,0001,029,0002,113,536
8May 13, 2026 16:267,89672,982,01864,529,0001,015,0002,113,536
9May 13, 2026 16:268,03675,958,37765,701,0001,000,0002,113,536