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 09:42Josu San MartinJosu San MartinScore: 29,064Success
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 09:4328,985154,150,497140,757,0001,273,0002,113,536
2Aug 4, 2026 09:4329,009151,198,391141,090,0001,056,0002,113,536
3Aug 4, 2026 09:4329,056150,837,607141,358,0001,018,0002,113,536
4Aug 4, 2026 09:4329,057150,925,394141,358,0001,026,0002,113,536
5Aug 4, 2026 09:4329,064151,487,126141,404,0001,011,0002,113,536
6Aug 4, 2026 09:4329,066151,439,464141,172,0001,256,0002,113,536
7Aug 4, 2026 09:4329,141155,167,123141,731,0001,060,0002,113,536
8Aug 4, 2026 09:4329,165151,999,353141,659,0001,250,0002,113,536
9Aug 4, 2026 09:4330,464157,784,975148,267,0001,008,0002,113,536