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 13, 2026 00:20Victor MerckléVictor MerckléScore: 3,788Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 13, 2026 00:213,75339,586,26430,062,0001,088,0002,117,632stderr
2Aug 13, 2026 00:213,75639,618,49530,018,0001,163,0002,117,632stderr
3Aug 13, 2026 00:213,76739,685,74130,169,0001,103,0002,117,632stderr
4Aug 13, 2026 00:213,78439,823,24530,260,0001,154,0002,117,632stderr
5Aug 13, 2026 00:213,78839,867,48230,259,0001,188,0002,117,632stderr
6Aug 13, 2026 00:213,79640,272,74430,445,0001,066,0002,117,632stderr
7Aug 13, 2026 00:213,80139,979,26430,392,0001,162,0002,117,632stderr
8Aug 13, 2026 00:213,82840,152,69530,698,0001,077,0002,117,632stderr
9Aug 13, 2026 00:213,87841,261,51131,102,0001,088,0002,117,632stderr