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 listMay 25, 2025 22:51Abhijit RamanAbhijit RamanScore: 78,028Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2025 22:5177,817669,711,378589,889,00055,989,0002,269,184
2May 25, 2025 22:5177,850673,461,796589,138,00057,013,0002,285,568
3May 25, 2025 22:5177,899671,731,305585,601,00060,958,0002,273,280
4May 25, 2025 22:5178,021672,186,985588,611,00058,961,0002,273,280
5May 25, 2025 22:5178,028678,105,318585,667,00061,964,0002,392,064
6May 25, 2025 22:5178,033668,893,180587,705,00059,969,0002,273,280
7May 25, 2025 22:5178,047673,739,824589,809,00057,981,0002,273,280
8May 25, 2025 22:5178,089669,039,145591,130,00057,012,0002,273,280
9May 25, 2025 22:5178,126671,995,380588,499,00059,948,0002,273,280