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 listApr 15, 2025 23:54pavolkomanpavolkomanScore: 365,095Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 15, 2025 23:54364,5373,053,925,2922,915,739,000109,914,0002,379,776
2Apr 15, 2025 23:54364,7263,060,720,1542,923,319,000103,904,0002,543,616
3Apr 15, 2025 23:54364,8673,056,528,9542,900,507,000127,890,0002,351,104
4Apr 15, 2025 23:54365,0823,061,139,9612,927,312,000102,870,0002,351,104
5Apr 15, 2025 23:54365,0953,065,344,7542,925,385,000104,906,0002,392,064
6Apr 15, 2025 23:54365,1093,058,762,4102,932,485,00097,916,0002,330,624
7Apr 15, 2025 23:54365,3243,064,512,6762,914,299,000117,890,0002,351,104
8Apr 15, 2025 23:54366,0863,071,076,5402,918,652,000119,862,0002,351,104
9Apr 15, 2025 23:54367,7863,089,400,1502,960,729,00091,898,0002,293,760