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 13:55Kevin HeaveyKevin HeaveyScore: 52,660Success
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 14:1852,340266,627,896246,608,0009,860,0002,113,536
2Jul 27, 2026 14:1852,378266,762,191246,812,0009,841,00020,480
3Jul 27, 2026 14:1852,382266,731,226246,790,0009,886,00020,480
4Jul 27, 2026 14:1852,652268,113,074246,642,00011,355,00020,480
5Jul 27, 2026 14:1852,660268,114,347246,314,00011,720,00020,480
6Jul 27, 2026 14:1852,662268,231,589246,486,00011,558,00020,480
7Jul 27, 2026 14:1852,743268,585,756247,146,00011,295,00020,480
8Jul 27, 2026 14:1852,802269,630,106246,362,00012,372,0002,113,536
9Jul 27, 2026 14:1852,824268,917,971246,482,00012,360,00020,480