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:49Josu San MartinJosu San MartinScore: 25,190Success
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:5025,173132,218,272122,087,0001,263,0002,113,536
2Aug 4, 2026 17:5025,173131,915,399122,097,0001,253,0002,113,536
3Aug 4, 2026 17:5025,178132,350,589122,121,0001,253,0002,113,536
4Aug 4, 2026 17:5025,187132,427,939122,157,0001,261,0002,113,536
5Aug 4, 2026 17:5025,190131,856,069122,184,0001,248,0002,113,536
6Aug 4, 2026 17:5025,195132,595,612122,197,0001,263,0002,113,536
7Aug 4, 2026 17:5025,199132,467,334122,207,0001,271,0002,113,536
8Aug 4, 2026 17:5025,240132,720,878122,420,0001,259,0002,113,536
9Aug 4, 2026 17:5025,307133,109,392122,756,0001,249,0002,113,536