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 22:54k1k1Score: 58,509Success
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 22:5458,473511,881,248483,326,0002,001,0002,277,376
2Apr 15, 2025 22:5458,489518,005,210482,458,0003,002,0002,277,376
3Apr 15, 2025 22:5458,490513,880,681483,468,0001,997,0002,273,280
4Apr 15, 2025 22:5458,492511,820,980482,484,0002,996,0002,277,376
5Apr 15, 2025 22:5458,509516,678,938484,628,000999,0002,273,280
6Apr 15, 2025 22:5458,510513,417,798484,633,0001,001,0002,367,488
7Apr 15, 2025 22:5458,510513,279,433483,634,0001,998,0002,277,376
8Apr 15, 2025 22:5458,517517,021,497482,693,0002,998,0002,269,184
9Apr 15, 2025 22:5458,534517,326,031483,830,0001,999,0002,277,376