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 03:32Josu San MartinJosu San MartinScore: 28,938Success
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 03:3228,903150,055,986140,367,0001,262,0002,113,536
2Aug 3, 2026 03:3228,915150,098,829140,414,0001,274,0002,113,536
3Aug 3, 2026 03:3228,916150,171,171140,422,0001,271,0002,113,536
4Aug 3, 2026 03:3228,928149,929,976140,735,0001,015,0002,113,536
5Aug 3, 2026 03:3228,938150,223,324140,538,0001,260,0002,113,536
6Aug 3, 2026 03:3228,943150,318,862140,566,0001,259,0002,113,536
7Aug 3, 2026 03:3229,300152,045,390142,303,0001,271,0002,113,536
8Aug 3, 2026 03:3229,420152,586,382143,131,0001,027,0002,113,536
9Aug 3, 2026 03:3229,945154,927,809145,714,0001,021,0002,113,536