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 2, 2026 11:00Josu San MartinJosu San MartinScore: 33,875Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 11:0133,824175,801,301164,623,0001,118,0002,113,536
2Aug 2, 2026 11:0133,837176,154,490164,672,0001,130,0002,113,536
3Aug 2, 2026 11:0133,850175,925,542164,749,0001,118,0002,113,536
4Aug 2, 2026 11:0133,855175,951,153164,763,0001,129,0002,113,536
5Aug 2, 2026 11:0133,875176,085,483164,864,0001,124,0002,113,536
6Aug 2, 2026 11:0133,884176,072,018164,926,0001,109,0002,113,536
7Aug 2, 2026 11:0133,958177,208,607165,257,0001,138,0002,113,536
8Aug 2, 2026 11:0134,130178,076,113166,106,0001,131,0002,113,536
9Aug 2, 2026 11:0135,651184,718,118173,576,0001,115,0002,113,536