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 listSep 26, 2026 18:00Kevin HeaveyKevin HeaveyScore: 24,110Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2026 18:0324,101126,656,512117,012,0001,086,00020,480
2Sep 26, 2026 18:0324,105126,840,623117,032,0001,083,00020,480
3Sep 26, 2026 18:0324,107126,941,732117,042,0001,084,00020,480
4Sep 26, 2026 18:0324,109126,970,976117,073,0001,065,00020,480
5Sep 26, 2026 18:0324,110126,964,291116,973,0001,168,00020,480
6Sep 26, 2026 18:0324,110126,991,555117,061,0001,082,00020,480
7Sep 26, 2026 18:0324,120128,464,637117,033,0001,159,00020,480
8Sep 26, 2026 18:0324,121126,927,156117,113,0001,084,00020,480
9Sep 26, 2026 18:0324,123127,006,395117,125,0001,079,00020,480