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 5, 2026 15:17Josu San MartinJosu San MartinScore: 25,958Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 5, 2026 15:1825,914135,699,558125,742,0001,241,0002,113,536
2Aug 5, 2026 15:1825,918136,026,708125,721,0001,280,0002,113,536
3Aug 5, 2026 15:1825,918136,686,086125,734,0001,269,0002,113,536
4Aug 5, 2026 15:1825,931136,135,408125,802,0001,260,0002,113,536
5Aug 5, 2026 15:1825,958136,249,242125,934,0001,264,0002,113,536
6Aug 5, 2026 15:1825,977136,331,296126,032,0001,258,0002,113,536
7Aug 5, 2026 15:1825,989135,758,757126,092,0001,255,0002,113,536
8Aug 5, 2026 15:1826,058136,178,181126,431,0001,257,0002,113,536
9Aug 5, 2026 15:1826,254137,659,050127,393,0001,254,0002,113,536