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 14, 2026 17:49marko1597marko1597Score: 6,380Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 17:506,25761,973,78050,780,0001,159,0002,117,632stderr
2Aug 14, 2026 17:506,26562,108,71550,854,0001,149,0002,117,632stderr
3Aug 14, 2026 17:506,35162,714,58451,562,0001,157,0002,117,632stderr
4Aug 14, 2026 17:506,36662,849,30551,694,0001,150,0002,117,632stderr
5Aug 14, 2026 17:506,38063,718,88451,781,0001,178,0002,117,632stderr
6Aug 14, 2026 17:506,38263,195,10151,800,0001,174,0002,117,632stderr
7Aug 14, 2026 17:506,62265,737,37953,795,0001,170,0002,117,632stderr
8Aug 14, 2026 17:506,62865,098,84753,875,0001,142,0002,117,632stderr
9Aug 14, 2026 17:506,63165,802,03853,864,0001,175,0002,117,632stderr