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 23, 2026 19:48Victor MerckléVictor MerckléScore: 3,763Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 19:493,74439,485,86229,953,0001,126,0002,117,632stderr
2Aug 23, 2026 19:493,75141,490,78929,929,0001,206,0002,117,632stderr
3Aug 23, 2026 19:493,75439,550,95330,040,0001,120,0002,117,632stderr
4Aug 23, 2026 19:493,75739,588,87930,046,0001,144,0002,117,632stderr
5Aug 23, 2026 19:493,76339,633,05330,123,0001,113,0002,117,632stderr
6Aug 23, 2026 19:493,76539,660,88930,163,0001,092,0002,117,632stderr
7Aug 23, 2026 19:493,77639,719,66330,272,0001,076,0002,117,632stderr
8Aug 23, 2026 19:493,77939,772,68430,235,0001,135,0002,117,632stderr
9Aug 23, 2026 19:493,81340,529,10230,517,0001,135,0002,117,632stderr