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 01:20Josu San MartinJosu San MartinScore: 29,539Success
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 01:2029,513153,184,550143,347,0001,267,0002,113,536
2Aug 3, 2026 01:2029,526153,758,160143,666,0001,014,0002,113,536
3Aug 3, 2026 01:2029,531153,821,727143,433,0001,273,0002,113,536
4Aug 3, 2026 01:2029,531153,679,610143,443,0001,260,0002,113,536
5Aug 3, 2026 01:2029,539155,276,466143,740,0001,005,0002,113,536
6Aug 3, 2026 01:2029,543153,854,280143,489,0001,275,0002,113,536
7Aug 3, 2026 01:2029,657154,392,671144,044,0001,278,0002,113,536
8Aug 3, 2026 01:2029,732155,356,336144,423,0001,264,0002,113,536
9Aug 3, 2026 01:2029,796155,174,056144,726,0001,277,0002,113,536