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 27, 2026 12:43Kevin HeaveyKevin HeaveyScore: 54,486Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2026 12:4854,183277,962,913253,420,00012,077,00020,480
2Jul 27, 2026 12:4854,238275,830,048253,615,00012,153,00020,480
3Jul 27, 2026 12:4854,367276,516,755253,270,00013,132,00020,480
4Jul 27, 2026 12:4854,424277,501,353253,060,00013,619,00020,480
5Jul 27, 2026 12:4854,486277,010,834253,016,00013,968,00020,480
6Jul 27, 2026 12:4854,539277,977,620253,446,00013,797,00020,480
7Jul 27, 2026 12:4854,738278,289,276253,142,00015,078,00020,480
8Jul 27, 2026 12:4854,806278,536,771253,089,00015,462,00020,480
9Jul 27, 2026 12:4862,060314,866,184290,529,00013,565,00020,480