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 00:56Victor MerckléVictor MerckléScore: 7,074Success
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 00:576,96266,330,06056,630,0001,155,0002,117,632stderr
2Aug 25, 2026 00:576,99966,520,77056,911,0001,188,0002,117,632stderr
3Aug 25, 2026 00:577,00366,525,86157,021,0001,110,0002,117,632stderr
4Aug 25, 2026 00:577,02266,706,85257,180,0001,104,0002,117,632stderr
5Aug 25, 2026 00:577,07467,109,78957,602,0001,116,0002,117,632stderr
6Aug 25, 2026 00:577,09367,255,56657,656,0001,217,0002,117,632stderr
7Aug 25, 2026 00:577,13367,615,89858,090,0001,122,0002,117,632stderr
8Aug 25, 2026 00:577,13867,725,53658,085,0001,168,0002,117,632stderr
9Aug 25, 2026 00:577,19068,109,21958,544,0001,133,0002,117,632stderr