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 listJan 9, 2025 02:41Ian MckibbenIan MckibbenScore: 51,358Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2025 02:4151,285456,316,875423,666,0001,998,0002,269,184
2Jan 9, 2025 02:4151,300450,488,336423,790,0001,999,0002,289,664
3Jan 9, 2025 02:4151,329448,827,899424,033,0002,000,0002,273,280
4Jan 9, 2025 02:4151,350447,762,882424,201,0002,000,0002,289,664
5Jan 9, 2025 02:4151,358455,495,004424,274,0002,001,0002,265,088
6Jan 9, 2025 02:4151,369449,044,796426,363,00002,277,376
7Jan 9, 2025 02:4151,377453,111,903426,427,00002,289,664
8Jan 9, 2025 02:4151,513454,846,548425,559,0001,997,0002,265,088
9Jan 9, 2025 02:4151,553451,322,741426,894,000999,0002,265,088