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 03:50Josu San MartinJosu San MartinScore: 24,216Success
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 03:5024,208127,074,879117,370,0001,250,0002,113,536
2Aug 29, 2026 03:5024,213127,063,394117,394,0001,251,0002,113,536
3Aug 29, 2026 03:5024,214127,054,465117,397,0001,254,0002,113,536
4Aug 29, 2026 03:5024,215127,191,563117,404,0001,254,0002,113,536
5Aug 29, 2026 03:5024,216127,090,632117,413,0001,247,0002,113,536
6Aug 29, 2026 03:5024,218127,199,075117,411,0001,258,0002,113,536
7Aug 29, 2026 03:5024,219127,086,699117,423,0001,252,0002,113,536
8Aug 29, 2026 03:5024,223127,122,737117,453,0001,244,0002,113,536
9Aug 29, 2026 03:5024,841130,173,328120,466,0001,257,0002,113,536