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 listSep 1, 2026 06:19Victor MerckléVictor MerckléScore: 3,638Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 06:203,62538,489,62728,975,0001,114,0002,117,632stderr
2Sep 1, 2026 06:203,62638,531,62128,967,0001,131,0002,117,632stderr
3Sep 1, 2026 06:203,62739,189,23028,966,0001,139,0002,117,632stderr
4Sep 1, 2026 06:203,63238,577,98529,003,0001,150,0002,117,632stderr
5Sep 1, 2026 06:203,63838,685,08229,065,0001,134,0002,117,632stderr
6Sep 1, 2026 06:203,64538,597,91929,169,0001,086,0002,117,632stderr
7Sep 1, 2026 06:203,65838,753,56829,216,0001,148,0002,117,632stderr
8Sep 1, 2026 06:203,66438,888,91929,230,0001,188,0002,117,632stderr
9Sep 1, 2026 06:203,67538,924,77429,383,0001,122,0002,117,632stderr