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 listNov 11, 2024 15:56koenigskrautkoenigskrautScore: 99,646Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2024 15:5699,600849,767,041824,679,0001,999,0002,281,472
2Nov 11, 2024 15:5699,620846,590,985825,848,000999,0002,482,176
3Nov 11, 2024 15:5699,626851,315,928825,899,000999,0002,482,176
4Nov 11, 2024 15:5699,630845,623,766825,928,000999,0002,281,472
5Nov 11, 2024 15:5699,646856,990,991826,065,0001,000,0002,281,472
6Nov 11, 2024 15:5699,652853,292,519825,111,0001,997,0002,281,472
7Nov 11, 2024 15:5699,665854,876,795826,223,0001,000,0002,490,368
8Nov 11, 2024 15:56108,832934,260,120901,309,0001,998,0002,482,176
9Nov 11, 2024 15:56108,834924,230,400901,324,0001,998,0002,281,472