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 12:57Kevin HeaveyKevin HeaveyScore: 56,614Success
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:1656,121284,859,981265,792,0009,203,0002,113,536
2Jul 27, 2026 13:1656,173285,302,941266,120,0009,128,00020,480
3Jul 27, 2026 13:1656,438286,435,954265,699,00010,850,0002,113,536
4Jul 27, 2026 13:1656,584287,211,185265,514,00011,751,0002,113,536
5Jul 27, 2026 13:1656,614287,300,948265,183,00012,230,00020,480
6Jul 27, 2026 13:1656,626287,231,713265,325,00012,147,00020,480
7Jul 27, 2026 13:1656,730287,860,083266,954,00011,026,0002,113,536
8Jul 27, 2026 13:1656,757287,939,876265,980,00012,130,00020,480
9Jul 27, 2026 13:1657,186290,092,562268,254,00011,958,0002,113,536