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 listSep 17, 2025 19:19sheryllynn24sheryllynn24Score: 21,250Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2025 19:2321,223201,454,566173,145,0003,002,0002,273,280
2Sep 17, 2025 19:2321,230199,785,642174,211,0002,002,0002,277,376
3Sep 17, 2025 19:2321,232206,485,704175,228,0001,001,0002,273,280
4Sep 17, 2025 19:2321,235208,914,458173,245,0003,004,0002,523,136
5Sep 17, 2025 19:2321,241197,780,094174,300,0002,003,0002,363,392
6Sep 17, 2025 19:1921,245201,269,600175,333,0001,001,0002,519,040
7Sep 17, 2025 19:2321,250201,864,517175,369,0001,002,0002,510,848
8Sep 17, 2025 19:2321,266202,395,710175,509,0001,002,0002,273,280
9Sep 17, 2025 19:2321,269205,006,056175,526,0001,003,0002,273,280
10Sep 17, 2025 19:1921,592207,243,934177,214,0002,002,0002,277,376
11Sep 17, 2025 19:2321,623207,706,781179,475,00002,519,040
12Sep 17, 2025 19:1921,655211,236,568176,738,0002,995,0002,510,848