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 listAug 3, 2026 20:30anboto1anboto1Score: 58,331Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 20:3157,625291,497,377281,256,0001,111,0002,113,536
2Aug 3, 2026 20:3157,677291,637,406281,395,0001,224,0002,113,536
3Aug 3, 2026 20:3157,770292,157,116281,952,0001,124,0002,113,536
4Aug 3, 2026 20:3158,244294,521,099284,277,0001,120,0002,113,536
5Aug 3, 2026 20:3158,331294,316,780284,711,0001,113,0002,113,536
6Aug 3, 2026 20:3158,562295,509,457285,840,0001,115,0002,113,536
7Aug 3, 2026 20:3158,779296,533,806286,856,0001,163,0002,113,536
8Aug 3, 2026 20:3159,212298,640,412289,025,0001,118,0002,113,536
9Aug 3, 2026 20:3159,388300,126,781289,894,0001,109,0002,113,536