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 16, 2025 00:30zielajzielajScore: 37,399Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2025 00:3037,363205,916,897182,079,0001,000,0002,338,816
2Jul 16, 2025 00:3037,367214,555,353181,095,0002,001,0002,441,216
3Jul 16, 2025 00:3037,371207,455,567181,116,0002,001,0002,314,240
4Jul 16, 2025 00:3037,377210,531,658182,148,0001,000,0002,449,408
5Jul 16, 2025 00:3037,399207,922,183181,253,0002,002,0002,457,600
6Jul 16, 2025 00:3037,694211,225,290183,701,000998,0002,465,792
7Jul 16, 2025 00:3038,335209,323,937186,844,000999,0002,322,432
8Jul 16, 2025 00:3038,398211,163,088186,147,0002,001,0002,318,336
9Jul 16, 2025 00:3040,051218,140,656195,249,0001,001,0002,314,240