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 06:31Josu San MartinJosu San MartinScore: 29,143Success
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 06:3129,120151,106,277141,430,0001,258,0002,113,536
2Aug 3, 2026 06:3129,120151,179,042141,422,0001,267,0002,113,536
3Aug 3, 2026 06:3129,125151,137,301141,451,0001,262,0002,113,536
4Aug 3, 2026 06:3129,134151,278,814141,489,0001,271,0002,113,536
5Aug 3, 2026 06:3129,143151,266,294141,532,0001,273,0002,113,536
6Aug 3, 2026 06:3129,147151,236,476141,563,0001,261,0002,113,536
7Aug 3, 2026 06:3129,216151,581,732141,893,0001,267,0002,113,536
8Aug 3, 2026 06:3129,385152,275,346142,939,0001,048,0002,113,536
9Aug 3, 2026 06:3131,819164,339,225154,660,0001,256,0002,113,536