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 listAug 31, 2026 03:25Josu San MartinJosu San MartinScore: 4,555Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 03:264,54146,107,12636,665,0001,032,0002,113,536
2Aug 31, 2026 03:264,54446,152,09136,692,0001,028,0002,113,536
3Aug 31, 2026 03:264,54746,201,13236,691,0001,052,0002,113,536
4Aug 31, 2026 03:264,55046,226,89936,645,0001,120,0002,113,536
5Aug 31, 2026 03:264,55546,357,82336,764,0001,043,0002,113,536
6Aug 31, 2026 03:264,55746,072,07236,775,0001,049,0002,113,536
7Aug 31, 2026 03:264,56946,341,64736,800,0001,123,0002,113,536
8Aug 31, 2026 03:264,60146,688,23737,149,0001,043,0002,113,536
9Aug 31, 2026 03:264,61846,808,55137,310,0001,027,0002,113,536