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 21, 2025 21:24Valentin KofmanValentin KofmanScore: 56,559Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2025 21:2456,552495,507,362468,382,0001,000,0002,273,280
2Jun 21, 2025 21:2456,555497,631,673468,409,0001,000,0002,273,280
3Jun 21, 2025 21:2456,555500,724,249468,403,0001,000,0002,400,256
4Jun 21, 2025 21:2456,558496,219,858468,428,0001,000,0002,400,256
5Jun 21, 2025 21:2456,559495,323,006468,441,0001,000,0002,273,280
6Jun 21, 2025 21:2456,560498,183,843468,450,0001,000,0002,392,064
7Jun 21, 2025 21:2456,562495,209,649468,461,0001,000,0002,396,160
8Jun 21, 2025 21:2456,566492,360,743468,503,000998,0002,392,064
9Jun 21, 2025 21:2456,579499,588,340468,609,000999,0002,273,280