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 11:57Kevin HeaveyKevin HeaveyScore: 74,696Success
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 11:5973,408371,056,329351,196,0008,507,00020,480
2Jul 27, 2026 11:5973,588370,432,240351,165,0009,419,00020,480
3Jul 27, 2026 11:5973,713371,064,777351,203,0009,991,00020,480
4Jul 27, 2026 11:5974,197373,443,697352,138,00011,432,00020,480
5Jul 27, 2026 11:5974,696375,811,456352,153,00013,860,00020,480
6Jul 27, 2026 11:5974,828376,548,431352,666,00013,995,00020,480
7Jul 27, 2026 11:5974,857376,738,547352,547,00014,255,0002,113,536
8Jul 27, 2026 11:5975,533392,246,527353,021,00017,095,00020,480
9Jul 27, 2026 11:5976,728387,170,295361,900,00014,071,00020,480