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 25, 2024 02:06Steve HanSteve HanScore: 75,241Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2024 02:0371,654681,597,555594,727,82402,273,280
2Apr 25, 2024 02:0371,784658,567,295595,807,95402,281,472
3Apr 25, 2024 02:0371,793657,371,586595,880,78902,277,376
4Apr 25, 2024 02:0575,136685,446,323623,627,46702,277,376
5Apr 25, 2024 02:0675,241682,562,933624,503,51502,277,376
6Apr 25, 2024 02:0575,722704,736,027628,494,36902,273,280
7Apr 25, 2024 02:0576,226689,073,556632,672,81702,260,992
8Apr 25, 2024 02:0676,407695,139,415634,174,26002,277,376
9Apr 25, 2024 02:0677,195706,074,994640,717,14202,273,280