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 listDec 27, 2024 19:24NeoNeoScore: 54,238Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2024 19:2454,222476,104,568448,039,0002,000,0002,289,664
2Dec 27, 2024 19:2454,225479,066,786448,064,0002,000,0002,289,664
3Dec 27, 2024 19:2454,225472,809,523448,071,0002,000,0002,289,664
4Dec 27, 2024 19:2454,235473,410,738448,149,0002,000,0002,289,664
5Dec 27, 2024 19:2454,238477,657,424449,172,0001,000,0002,289,664
6Dec 27, 2024 19:2454,244473,002,734448,226,0002,001,0002,527,232
7Dec 27, 2024 19:2454,244468,185,636449,228,0001,000,0002,285,568
8Dec 27, 2024 19:2454,251471,567,654448,285,0002,001,0002,281,472
9Dec 27, 2024 19:2454,262478,656,647449,372,0001,000,0002,289,664