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 26, 2026 04:08Victor MerckléVictor MerckléScore: 3,796Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 04:083,76139,356,70730,087,0001,130,0002,117,632stderr
2Aug 26, 2026 04:083,76239,357,54830,125,0001,107,0002,117,632stderr
3Aug 26, 2026 04:083,76839,612,94830,216,0001,060,0002,117,632stderr
4Aug 26, 2026 04:083,79539,697,02530,292,0001,208,0002,117,632stderr
5Aug 26, 2026 04:083,79639,845,40730,416,0001,098,0002,117,632stderr
6Aug 26, 2026 04:083,80439,761,60530,424,0001,150,0002,117,632stderr
7Aug 26, 2026 04:083,80539,896,90630,510,0001,076,0002,117,632stderr
8Aug 26, 2026 04:083,81239,778,53430,559,0001,082,0002,117,632stderr
9Aug 26, 2026 04:083,84040,453,63330,749,0001,130,0002,117,632stderr