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:08Kevin HeaveyKevin HeaveyScore: 53,109Success
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 13:2352,717268,374,013249,976,0008,342,00020,480
2Jul 27, 2026 13:2352,842269,043,957250,177,0008,751,0002,113,536
3Jul 27, 2026 13:2352,916270,177,687250,320,0008,970,00020,480
4Jul 27, 2026 13:2353,086270,129,678249,568,00010,554,00020,480
5Jul 27, 2026 13:2353,109270,166,156249,895,00010,341,00020,480
6Jul 27, 2026 13:2353,177270,648,392249,578,00010,994,00020,480
7Jul 27, 2026 13:2353,201270,694,569249,559,00011,130,00020,480
8Jul 27, 2026 13:2353,334271,333,713250,036,00011,301,00020,480
9Jul 27, 2026 13:2353,710274,176,161250,002,00013,178,00020,480