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 1, 2026 03:38Josu San MartinJosu San MartinScore: 35,762Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 03:3935,745185,326,971174,014,0001,138,0002,113,536
2Aug 1, 2026 03:3935,747187,331,246174,044,0001,119,0002,113,536
3Aug 1, 2026 03:3935,756186,056,953174,084,0001,123,0002,113,536
4Aug 1, 2026 03:3935,762186,087,590174,132,0001,106,0002,113,536
5Aug 1, 2026 03:3935,762186,136,093174,090,0001,146,0002,113,536
6Aug 1, 2026 03:3935,768185,404,058174,152,0001,116,0002,113,536
7Aug 1, 2026 03:3935,769186,158,236174,146,0001,123,0002,113,536
8Aug 1, 2026 03:3935,792185,820,108174,253,0001,128,0002,113,536
9Aug 1, 2026 03:3935,792185,517,988174,115,0001,269,0002,113,536