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 3, 2026 19:57Josu San MartinJosu San MartinScore: 27,534Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 19:5827,458142,961,118133,290,0001,257,0002,113,536
2Aug 3, 2026 19:5827,474143,031,544133,364,0001,262,0002,113,536
3Aug 3, 2026 19:5827,488143,180,161133,487,0001,207,0002,113,536
4Aug 3, 2026 19:5827,508143,244,517133,526,0001,267,0002,113,536
5Aug 3, 2026 19:5827,534143,311,775133,865,0001,053,0002,113,536
6Aug 3, 2026 19:5827,542143,446,546133,934,0001,023,0002,113,536
7Aug 3, 2026 19:5827,557143,225,150133,982,0001,052,0002,113,536
8Aug 3, 2026 19:5827,625143,960,419134,097,0001,267,0002,113,536
9Aug 3, 2026 19:5827,717144,323,228134,552,0001,263,0002,113,536