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 10:33Kevin HeaveyKevin HeaveyScore: 106,951Success
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 10:34106,732540,252,017511,175,00011,812,00020,480
2Jul 27, 2026 10:34106,748533,045,479511,294,00011,774,00020,480
3Jul 27, 2026 10:34106,830533,421,745511,224,00012,243,00020,480
4Jul 27, 2026 10:34106,903533,858,290511,072,00012,754,00020,480
5Jul 27, 2026 10:34106,951534,027,323511,257,00012,804,00020,480
6Jul 27, 2026 10:34106,994534,171,041511,451,00012,821,0002,113,536
7Jul 27, 2026 10:34107,044534,432,552511,507,00013,010,0002,113,536
8Jul 27, 2026 10:34107,168535,181,870510,956,00014,172,00020,480
9Jul 27, 2026 10:34107,178535,062,090511,179,00013,998,00020,480