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 11, 2026 17:02Victor MerckléVictor MerckléScore: 64,076Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 17:0363,721537,250,846527,740,0001,147,0002,117,632stderr
2Aug 11, 2026 17:0363,824538,558,527528,601,0001,139,0002,117,632stderr
3Aug 11, 2026 17:0363,936539,051,971529,624,0001,046,0002,117,632stderr
4Aug 11, 2026 17:0364,070541,278,465530,629,0001,153,0002,117,632stderr
5Aug 11, 2026 17:0364,076540,368,778530,659,0001,173,0002,117,632stderr
6Aug 11, 2026 17:0364,132540,673,087531,285,0001,013,0002,117,632stderr
7Aug 11, 2026 17:0364,353542,574,325532,979,0001,151,0002,117,632stderr
8Aug 11, 2026 17:0364,393542,884,857533,466,0001,003,0002,117,632stderr
9Aug 11, 2026 17:0364,500544,264,887534,261,0001,097,0002,117,632stderr