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, 2026 20:33TonyTonyScore: 9,521Success
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, 2026 20:349,39187,770,15675,507,0002,442,0002,113,536
2Aug 2, 2026 20:349,40387,950,08975,585,0002,461,0002,113,536
3Aug 2, 2026 20:349,46888,449,83575,905,0002,685,0002,113,536
4Aug 2, 2026 20:349,50490,329,81076,218,0002,670,0002,113,536
5Aug 2, 2026 20:349,52188,878,35076,366,0002,660,0002,113,536
6Aug 2, 2026 20:349,52688,933,22076,410,0002,660,0002,113,536
7Aug 2, 2026 20:349,52888,951,85876,431,0002,657,0002,113,536
8Aug 2, 2026 20:349,55289,135,42176,611,0002,675,0002,113,536
9Aug 2, 2026 20:349,57689,310,37676,839,0002,647,0002,113,536