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 listNov 8, 2026 15:59janwwwjanwwwScore: 30,063Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 8, 2026 16:0029,037151,575,330128,173,00014,110,00020,480
2Nov 8, 2026 16:0029,313153,229,475128,196,00015,439,00020,480
3Nov 8, 2026 16:0029,345154,145,776128,172,00015,621,00020,480
4Nov 8, 2026 16:0030,031156,354,636128,291,00018,862,00020,480
5Nov 8, 2026 16:0030,063156,584,903128,169,00019,140,00020,480
6Nov 8, 2026 16:0030,172157,070,489128,206,00019,640,00020,480
7Nov 8, 2026 16:0030,245157,409,907128,218,00019,986,00020,480
8Nov 8, 2026 16:0030,249157,493,999128,186,00020,037,00020,480
9Nov 8, 2026 16:0030,272157,598,487128,231,00020,102,00020,480