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 29, 2026 01:07Josu San MartinJosu San MartinScore: 24,373Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 01:0724,360128,347,634118,117,0001,247,0002,113,536
2Aug 29, 2026 01:0724,362127,724,225118,130,0001,244,0002,113,536
3Aug 29, 2026 01:0724,366128,472,436118,134,0001,261,0002,113,536
4Aug 29, 2026 01:0724,372128,518,515118,166,0001,261,0002,113,536
5Aug 29, 2026 01:0724,373127,878,746118,175,0001,255,0002,113,536
6Aug 29, 2026 01:0724,374128,230,585118,176,0001,257,0002,113,536
7Aug 29, 2026 01:0724,377128,438,864118,193,0001,255,0002,113,536
8Aug 29, 2026 01:0724,384127,921,058118,240,0001,245,0002,113,536
9Aug 29, 2026 01:0724,387128,353,992118,253,0001,246,0002,113,536