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:47ndbnndbnScore: 108,923Success
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:47108,877926,796,407901,676,0001,999,0002,535,424
2Nov 11, 2024 15:47108,891926,539,396901,793,0001,999,0002,482,176
3Nov 11, 2024 15:47108,909927,965,780902,949,000999,0002,281,472
4Nov 11, 2024 15:47108,918933,544,485903,017,0001,000,0002,281,472
5Nov 11, 2024 15:47108,923924,549,508903,065,0001,000,0002,281,472
6Nov 11, 2024 15:47108,946935,120,934903,255,0001,000,0002,281,472
7Nov 11, 2024 15:47108,948929,595,268902,273,0001,998,0002,482,176
8Nov 11, 2024 15:47108,949931,809,610902,281,0001,998,0002,535,424
9Nov 11, 2024 15:47109,123932,592,026903,724,0001,999,0002,535,424