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 10, 2024 23:16koenigskrautkoenigskrautScore: 124,288Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 10, 2024 23:16124,2121,058,758,8421,029,960,000999,0002,482,176
2Nov 10, 2024 23:16124,2141,054,158,2921,029,975,000999,0002,281,472
3Nov 10, 2024 23:16124,2691,054,583,6611,029,438,0001,998,0002,281,472
4Nov 10, 2024 23:16124,2741,059,261,5721,029,474,0001,998,0002,486,272
5Nov 10, 2024 23:16124,2881,055,891,6731,029,593,0001,999,0002,281,472
6Nov 10, 2024 23:16124,3161,058,856,8991,029,827,0001,999,0002,281,472
7Nov 10, 2024 23:16124,3781,056,193,1321,030,340,0001,998,0002,281,472
8Nov 10, 2024 23:16124,3791,058,597,6141,030,347,0001,998,0002,486,272
9Nov 10, 2024 23:16124,3851,059,161,7711,030,400,0001,998,0002,281,472