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 listMay 17, 2026 13:39M-RochatM-RochatScore: 166,810Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 13:41166,442826,070,231814,353,0001,216,0002,113,536
2May 17, 2026 13:41166,651827,319,155815,366,0001,227,0002,113,536
3May 17, 2026 13:41166,703825,656,225815,586,0001,261,0002,113,536
4May 17, 2026 13:41166,759826,009,448815,883,0001,238,0002,113,536
5May 17, 2026 13:41166,810827,113,570816,151,0001,222,0002,113,536
6May 17, 2026 13:41167,204829,237,954818,077,0001,224,0002,113,536
7May 17, 2026 13:41167,217828,741,647818,130,0001,237,0002,113,536
8May 17, 2026 13:41168,098832,788,099822,466,0001,217,0002,113,536
9May 17, 2026 13:41169,558841,952,800829,615,0001,223,0002,113,536