Format integers Sergey Svistunov

Compute a checksum over the decimal representations of binary integers as fast as possible.

Input: 250 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: A uint64 checksum computed as:

CRC = sum of number_crc(n) for each n

where number_crc(n) converts n to its decimal string and sums ascii(digit) * position over each digit (0-indexed from the left).

Example: For n = 42, the decimal string is "42", so number_crc(42) = ascii('4') * 0 + ascii('2') * 1 = 52 * 0 + 50 * 1 = 50.

Back to listOct 4, 2022 12:24Robert BurkeRobert BurkeScore: 61,772Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 4, 2022 12:2458,731354,512,288287,779,73402,179,072
2Oct 4, 2022 12:2458,970353,323,737288,953,34102,191,360
3Oct 4, 2022 12:2459,068349,812,580289,431,71402,174,976
4Oct 4, 2022 12:2461,735330,550,831301,501,0001,001,0002,281,472
5Oct 4, 2022 12:2461,766330,203,070300,656,0001,997,0002,441,216
6Oct 4, 2022 12:2461,772325,012,906300,684,0001,997,0002,281,472
7Oct 4, 2022 12:2461,772334,629,528300,684,0001,997,0002,449,408
8Oct 4, 2022 12:2461,785329,595,709300,747,0001,998,0002,449,408
9Oct 4, 2022 12:2461,788326,292,831300,764,0001,998,0002,281,472
10Oct 4, 2022 12:2461,826324,957,545300,949,0001,999,0002,437,120
11Oct 4, 2022 12:2461,830325,248,941300,968,0001,999,0002,281,472
12Oct 4, 2022 12:2462,788336,779,530306,664,000998,0002,281,472