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 listJul 1, 2021 09:55gchebanovgchebanovScore: 208,782Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2021 10:05208,6541,076,801,0531,022,403,35602,273,280
2Jul 1, 2021 09:55208,7151,085,605,6861,022,701,45202,265,088
3Jul 1, 2021 10:05208,7631,086,109,7441,022,940,46502,248,704
4Jul 1, 2021 09:55208,7821,083,445,0051,023,030,13702,265,088
5Jul 1, 2021 10:05209,1111,091,622,0671,024,643,24802,260,992
6Jul 1, 2021 09:55209,1161,084,028,6881,024,669,69402,265,088