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 1, 2026 16:47Victor MerckléVictor MerckléScore: 12,544Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 16:4812,516111,864,892102,771,0001,112,0002,117,632stderr
2Jul 1, 2026 16:4812,526111,898,348102,856,0001,111,0002,117,632stderr
3Jul 1, 2026 16:4812,539113,256,986102,970,0001,110,0002,117,632stderr
4Jul 1, 2026 16:4812,542112,086,244103,094,0001,009,0002,117,632stderr
5Jul 1, 2026 16:4812,544112,052,698103,053,0001,066,0002,117,632stderr
6Jul 1, 2026 16:4812,547112,077,937103,104,0001,037,0002,117,632stderr
7Jul 1, 2026 16:4812,552112,160,261103,085,0001,099,0002,117,632stderr
8Jul 1, 2026 16:4812,556112,107,887103,183,0001,036,0002,117,632stderr
9Jul 1, 2026 16:4812,563112,162,474103,263,0001,013,0002,117,632stderr