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 4, 2026 17:42Josu San MartinJosu San MartinScore: 25,409Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 17:4325,176132,441,695122,097,0001,270,0002,113,536
2Aug 4, 2026 17:4325,208132,522,477122,263,0001,261,0002,113,536
3Aug 4, 2026 17:4325,266132,914,068122,776,0001,029,0002,113,536
4Aug 4, 2026 17:4325,285132,426,967122,624,0001,277,0002,113,536
5Aug 4, 2026 17:4325,409133,605,969123,247,0001,261,0002,113,536
6Aug 4, 2026 17:4325,413133,538,401123,293,0001,235,0002,113,536
7Aug 4, 2026 17:4325,429133,051,227123,343,0001,260,0002,113,536
8Aug 4, 2026 17:4325,430133,039,331123,346,0001,264,0002,113,536
9Aug 4, 2026 17:4325,443133,737,310123,411,0001,261,0002,113,536