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 31, 2026 19:12anboto1anboto1Score: 145,799Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 19:12145,540723,166,724712,071,0001,076,0002,113,536
2Jul 31, 2026 19:12145,748725,104,177713,089,0001,080,0002,113,536
3Jul 31, 2026 19:12145,769724,213,345713,200,0001,072,0002,113,536
4Jul 31, 2026 19:12145,771724,369,773713,192,0001,087,0002,113,536
5Jul 31, 2026 19:12145,799724,348,159713,339,0001,079,0002,113,536
6Jul 31, 2026 19:12145,815724,525,479713,417,0001,080,0002,113,536
7Jul 31, 2026 19:12145,944725,019,266714,060,0001,069,0002,113,536
8Jul 31, 2026 19:12145,966725,331,280714,144,0001,092,0002,113,536
9Jul 31, 2026 19:12146,013725,894,909714,373,0001,092,0002,113,536