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 13:23Josu San MartinJosu San MartinScore: 25,633Success
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 13:2325,574133,677,845124,038,0001,276,0002,113,536
2Aug 4, 2026 13:2325,591133,839,328124,145,0001,253,0002,113,536
3Aug 4, 2026 13:2325,597134,068,639124,168,0001,259,0002,113,536
4Aug 4, 2026 13:2325,625134,093,022124,307,0001,259,0002,113,536
5Aug 4, 2026 13:2325,633133,978,399124,340,0001,264,0002,113,536
6Aug 4, 2026 13:2325,634133,968,707124,351,0001,259,0002,113,536
7Aug 4, 2026 13:2325,666135,639,637124,488,0001,277,0002,113,536
8Aug 4, 2026 13:2325,887135,178,746125,588,0001,261,0002,113,536
9Aug 4, 2026 13:2326,082136,232,663126,527,0001,278,0002,113,536