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 02:51Josu San MartinJosu San MartinScore: 28,803Success
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 02:5228,774150,079,963139,736,0001,260,0002,113,536
2Aug 3, 2026 02:5228,780149,456,358139,755,0001,267,0002,113,536
3Aug 3, 2026 02:5228,792149,449,511139,806,0001,279,0002,113,536
4Aug 3, 2026 02:5228,801150,214,702140,113,0001,012,0002,113,536
5Aug 3, 2026 02:5228,803149,675,629140,124,0001,013,0002,113,536
6Aug 3, 2026 02:5228,815150,311,867140,128,0001,067,0002,113,536
7Aug 3, 2026 02:5228,914150,787,113140,409,0001,273,0002,113,536
8Aug 3, 2026 02:5229,373152,970,445142,667,0001,262,0002,113,536
9Aug 3, 2026 02:5229,512153,321,478143,337,0001,272,0002,113,536