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 11:14Victor MerckléVictor MerckléScore: 3,787Success
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 11:153,7262,041,043,64229,755,0001,178,0002,117,632stderr
2Aug 25, 2026 11:153,7572,041,148,24229,969,0001,220,0002,117,632stderr
3Aug 25, 2026 11:153,7632,041,547,59429,980,0001,254,0002,117,632stderr
4Aug 25, 2026 11:153,7802,041,646,06130,209,0001,168,0002,117,632stderr
5Aug 25, 2026 11:153,7872,041,849,19430,390,0001,047,0002,117,632stderr
6Aug 25, 2026 11:153,7912,041,926,59430,289,0001,182,0002,117,632stderr
7Aug 25, 2026 11:153,7972,041,706,12430,367,0001,154,0002,117,632stderr
8Aug 25, 2026 11:153,7992,041,373,33630,330,0001,202,0002,117,632stderr
9Aug 25, 2026 11:153,9332,042,438,01131,436,0001,212,0002,117,632stderr