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 listJun 23, 2025 20:45Valentin KofmanValentin KofmanScore: 10,939Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2025 20:457,81090,531,34062,829,0001,994,0002,269,184
2Jun 23, 2025 20:457,81091,221,54863,824,000997,0002,277,376
3Jun 23, 2025 20:458,01893,168,61865,539,0001,008,0002,269,184
4Jun 23, 2025 20:4510,939118,910,73090,797,00002,273,280
5Jun 23, 2025 20:4510,943116,795,19989,833,000998,0002,281,472
6Jun 23, 2025 20:4510,947120,585,42588,867,0001,997,0002,289,664