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 12, 2026 13:15Victor MerckléVictor MerckléScore: 4,079Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 13:164,05342,039,15232,564,0001,080,0002,117,632stderr
2Aug 12, 2026 13:164,05742,723,61332,556,0001,121,0002,117,632stderr
3Aug 12, 2026 13:164,05942,085,10132,608,0001,083,0002,117,632stderr
4Aug 12, 2026 13:164,06943,491,60732,682,0001,091,0002,117,632stderr
5Aug 12, 2026 13:164,07942,324,64232,749,0001,112,0002,117,632stderr
6Aug 12, 2026 13:164,14242,744,67733,329,0001,054,0002,117,632stderr
7Aug 12, 2026 13:164,18943,143,57333,707,0001,063,0002,117,632stderr
8Aug 12, 2026 13:164,20143,317,47933,781,0001,094,0002,117,632stderr
9Aug 12, 2026 13:164,20543,281,59733,831,0001,074,0002,117,632stderr