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 2, 2025 20:36Jack FrigaardJack FrigaardScore: 4,761Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2025 20:364,68563,154,16435,893,0002,991,0002,445,312
2Aug 2, 2025 20:364,69861,514,98035,992,0002,999,0002,449,408
3Aug 2, 2025 20:364,75667,073,05338,465,0001,012,0002,519,040
4Aug 2, 2025 20:364,76160,700,32337,493,0002,026,0002,519,040
5Aug 2, 2025 20:364,76562,601,77738,538,0001,014,0002,519,040
6Aug 2, 2025 20:364,76764,821,92538,550,0001,014,0002,519,040