Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listMay 11, 2026 01:59Josu San MartinJosu San MartinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 02:00044,185,74935,701,0001,084,0002,113,536expected "53691817295959926 ", got "53692035112635827 "
2May 11, 2026 02:004,15543,829,61633,411,0001,076,0002,113,536
3May 11, 2026 02:004,16642,960,44733,516,0001,069,0002,113,536
4May 11, 2026 02:004,16744,097,37133,465,0001,123,0002,113,536
5May 11, 2026 02:004,17142,278,86833,553,0001,073,0002,113,536
6May 11, 2026 02:004,21542,624,02733,901,0001,088,0002,113,536
7May 11, 2026 02:004,22944,193,05034,036,0001,072,0002,113,536
8May 11, 2026 02:004,24545,237,99234,148,0001,089,0002,113,536
9May 11, 2026 02:004,25645,912,18834,224,0001,101,0002,113,536