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:23Kevin HeaveyKevin HeaveyScore: 64,166Success
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:5063,625321,882,722303,211,0008,556,00020,480
2Jul 27, 2026 14:5063,725326,002,370303,067,0009,188,00020,480
3Jul 27, 2026 14:5063,759322,537,318303,561,0008,859,00020,480
4Jul 27, 2026 14:5063,872323,224,096302,968,00010,006,00020,480
5Jul 27, 2026 14:5064,166324,494,966303,051,00011,363,00020,480
6Jul 27, 2026 14:5064,222324,791,953304,341,00010,351,00020,480
7Jul 27, 2026 14:5064,475326,107,785303,068,00012,863,00020,480
8Jul 27, 2026 14:5064,495326,169,005304,923,00011,104,00020,480
9Jul 27, 2026 14:5064,628326,846,191306,444,00010,236,00020,480