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 15, 2026 21:42Tomislav TunkovicTomislav TunkovicScore: 29,660Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 21:4429,417153,251,663143,138,0001,008,00020,480
2Aug 15, 2026 21:4429,454153,161,570143,316,0001,010,00020,480
3Aug 15, 2026 21:4429,469152,859,476143,391,0001,011,00020,480
4Aug 15, 2026 21:4429,597153,600,930144,017,0001,011,00020,480
5Aug 15, 2026 21:4429,660164,818,087144,326,0001,010,00020,480
6Aug 15, 2026 21:4429,672154,475,522144,386,0001,009,00020,480
7Aug 15, 2026 21:4430,649158,551,799149,172,0001,009,00020,480
8Aug 15, 2026 21:4430,903159,930,826150,416,0001,010,00020,480
9Aug 15, 2026 21:4437,629192,825,689183,377,0001,006,00020,480