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 28, 2026 19:38Josu San MartinJosu San MartinScore: 25,235Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 19:3925,180132,448,691122,127,0001,258,0002,113,536
2Aug 28, 2026 19:3925,200131,852,066122,230,0001,253,0002,113,536
3Aug 28, 2026 19:3925,201132,544,719122,237,0001,251,0002,113,536
4Aug 28, 2026 19:3925,210131,670,236122,277,0001,253,0002,113,536
5Aug 28, 2026 19:3925,235132,087,114122,404,0001,251,0002,113,536
6Aug 28, 2026 19:3925,235131,979,181122,390,0001,264,0002,113,536
7Aug 28, 2026 19:3925,253132,196,221122,492,0001,252,0002,113,536
8Aug 28, 2026 19:3925,269132,295,360122,645,0001,175,0002,113,536
9Aug 28, 2026 19:3926,182137,111,865127,038,0001,257,0002,113,536