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 listAug 25, 2026 02:40Victor MerckléVictor MerckléScore: 8,212Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 02:417,88073,802,99564,276,0001,136,0002,117,632stderr
2Aug 25, 2026 02:417,89973,937,00164,475,0001,094,0002,117,632stderr
3Aug 25, 2026 02:417,90173,787,51564,503,0001,083,0002,117,632stderr
4Aug 25, 2026 02:417,91174,062,00064,527,0001,135,0002,117,632stderr
5Aug 25, 2026 02:418,21276,561,04667,068,0001,092,0002,117,632stderr
6Aug 25, 2026 02:418,24876,844,99967,326,0001,136,0002,117,632stderr
7Aug 25, 2026 02:418,27777,204,50067,511,0001,193,0002,117,632stderr
8Aug 25, 2026 02:418,29077,215,16767,701,0001,106,0002,117,632stderr
9Aug 25, 2026 02:418,45379,200,54269,059,0001,102,0002,117,632stderr