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 1, 2026 22:23TonyTonyScore: 40,840Success
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 22:2340,733347,318,463337,089,0001,002,0002,117,632
2Aug 1, 2026 22:2340,805347,936,712337,680,0001,008,0002,117,632
3Aug 1, 2026 22:2340,824348,087,108337,837,0001,003,0002,117,632
4Aug 1, 2026 22:2340,827348,131,152337,866,0001,002,0002,117,632
5Aug 1, 2026 22:2340,840348,273,597337,976,0001,002,0002,117,632
6Aug 1, 2026 22:2340,881348,544,093338,310,0001,004,0002,117,632
7Aug 1, 2026 22:2340,884348,608,336338,336,0001,005,0002,117,632
8Aug 1, 2026 22:2340,884350,076,065338,341,0001,003,0002,117,632
9Aug 1, 2026 22:2340,933348,983,425338,743,0001,004,0002,117,632