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 listApr 27, 2024 15:21Joad NacerJoad NacerScore: 15,692Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2024 15:2115,513185,885,596128,759,31402,285,568
2Apr 27, 2024 15:2115,519182,353,056128,804,13502,277,376
3Apr 27, 2024 15:2115,531191,785,295128,906,49702,281,472
4Apr 27, 2024 15:2115,636155,511,097127,781,0001,996,0002,285,568
5Apr 27, 2024 15:2115,640156,410,012127,817,0001,997,0002,260,992
6Apr 27, 2024 15:2115,678154,505,247128,127,0002,001,0002,265,088
7Apr 27, 2024 15:2115,692153,611,151128,243,0002,003,0002,355,200
8Apr 27, 2024 15:2115,770156,910,417129,895,000999,0002,285,568
9Apr 27, 2024 15:2115,793155,930,648129,081,0002,001,0002,285,568
10Apr 27, 2024 15:2115,826154,885,150129,350,0002,005,0002,510,848
11Apr 27, 2024 15:2116,133157,813,349131,906,0001,998,0002,510,848
12Apr 27, 2024 15:2116,563162,539,730136,468,0001,003,0002,285,568