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 29, 2026 03:05Josu San MartinJosu San MartinScore: 24,354Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 03:0624,349127,650,132118,059,0001,252,0002,113,536
2Aug 29, 2026 03:0624,350127,727,302118,057,0001,258,0002,113,536
3Aug 29, 2026 03:0624,350127,774,831118,064,0001,252,0002,113,536
4Aug 29, 2026 03:0624,351127,671,136118,072,0001,252,0002,113,536
5Aug 29, 2026 03:0624,354127,819,121118,086,0001,253,0002,113,536
6Aug 29, 2026 03:0624,355128,375,147118,076,0001,265,0002,113,536
7Aug 29, 2026 03:0624,360128,318,866118,105,0001,262,0002,113,536
8Aug 29, 2026 03:0624,366127,854,317118,391,0001,004,0002,113,536
9Aug 29, 2026 03:0624,412128,006,062118,371,0001,251,0002,113,536