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 14:50Kevin HeaveyKevin HeaveyScore: 65,497Success
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 15:3265,081328,875,870309,180,0009,720,00020,480
2Jul 27, 2026 15:3265,376330,343,426310,257,00010,089,00020,480
3Jul 27, 2026 15:3265,447331,508,915312,460,0008,234,00020,480
4Jul 27, 2026 15:3265,460330,949,083312,304,0008,450,00020,480
5Jul 27, 2026 15:3265,497330,950,662309,066,00011,872,00020,480
6Jul 27, 2026 15:3265,511331,693,851310,913,00010,093,00020,480
7Jul 27, 2026 15:3265,533331,135,364312,973,0008,140,00020,480
8Jul 27, 2026 15:3265,647331,780,468312,410,0009,262,00020,480
9Jul 27, 2026 15:3265,876333,615,447312,479,00010,314,00020,480