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 2, 2026 09:05A_ShamanA_ShamanScore: 206,002Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 09:06204,1511,011,021,629998,308,0002,036,0002,158,592
2Jul 2, 2026 09:06204,4891,012,686,437999,856,0002,142,0002,158,592
3Jul 2, 2026 09:06204,7171,013,765,8761,002,111,0001,005,0002,158,592
4Jul 2, 2026 09:06205,9331,019,729,9861,007,047,0002,029,0002,158,592
5Jul 2, 2026 09:06206,0021,020,086,3001,006,394,0003,019,0002,158,592
6Jul 2, 2026 09:06206,9081,024,531,9621,011,771,0002,083,0002,158,592
7Jul 2, 2026 09:06208,5891,034,496,9081,021,084,0001,004,0002,146,304
8Jul 2, 2026 09:06208,5961,033,068,2611,021,117,0001,004,0002,158,592
9Jul 2, 2026 09:06208,6401,032,975,6121,020,281,0002,055,0002,158,592