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 listJul 19, 2022 16:29Yuriy LyfenkoYuriy LyfenkoScore: 19,160Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 19, 2022 16:2919,148181,543,154156,926,0001,999,0002,506,752
2Jul 19, 2022 16:2919,155184,431,910157,984,000999,0002,273,280
3Jul 19, 2022 16:2919,156184,953,588156,996,0001,999,0002,269,184
4Jul 19, 2022 16:2919,157185,401,588157,007,0002,000,0002,502,656
5Jul 19, 2022 16:2919,158187,540,918157,008,0002,000,0002,277,376
6Jul 19, 2022 16:2919,158181,636,791157,008,0002,000,0002,269,184
7Jul 19, 2022 16:2919,160181,629,205157,028,0002,000,0002,277,376
8Jul 19, 2022 16:2919,164181,723,320158,062,0001,000,0002,273,280
9Jul 19, 2022 16:2919,165180,854,510157,066,0002,000,0002,277,376
10Jul 19, 2022 16:2920,009226,223,367166,076,53902,244,608
11Jul 19, 2022 16:2920,014226,891,267166,114,40702,244,608
12Jul 19, 2022 16:2920,014218,672,623166,112,74202,232,320