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 28, 2026 23:58Josu San MartinJosu San MartinScore: 25,189Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 23:5825,160131,751,613122,012,0001,274,0002,113,536
2Aug 28, 2026 23:5825,162132,281,723122,038,0001,260,0002,113,536
3Aug 28, 2026 23:5825,172132,337,456122,071,0001,276,0002,113,536
4Aug 28, 2026 23:5825,172131,744,676122,092,0001,255,0002,113,536
5Aug 28, 2026 23:5825,189131,857,925122,307,0001,123,0002,113,536
6Aug 28, 2026 23:5825,196131,886,763122,281,0001,184,0002,113,536
7Aug 28, 2026 23:5825,203131,940,863122,294,0001,201,0002,113,536
8Aug 28, 2026 23:5825,250132,743,275122,459,0001,266,0002,113,536
9Aug 28, 2026 23:5825,267132,289,695122,640,0001,171,0002,113,536