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 listSep 26, 2025 20:07sheryllynn24sheryllynn24Score: 6,488Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2025 20:076,37880,457,04050,938,0001,997,0002,285,568
2Sep 26, 2025 20:076,38282,626,67850,972,0001,998,0002,285,568
3Sep 26, 2025 20:076,38881,289,59451,017,0002,000,0002,285,568
4Sep 26, 2025 20:076,48882,471,00551,856,0001,994,0002,285,568
5Sep 26, 2025 20:076,51484,871,92552,062,0002,002,0002,519,040
6Sep 26, 2025 20:076,53779,121,09852,252,0002,009,0002,269,184