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 listMar 2, 2025 18:34Aniruddha DebAniruddha DebScore: 9,228Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 2, 2025 18:349,164106,720,95073,058,0003,002,0002,273,280
2Mar 2, 2025 18:349,18398,708,05173,211,0003,008,0002,387,968
3Mar 2, 2025 18:349,18997,741,44472,253,0004,014,0002,404,352
4Mar 2, 2025 18:349,19697,608,39172,309,0004,017,0002,449,408
5Mar 2, 2025 18:349,228105,880,55472,564,0004,031,0002,318,336
6Mar 2, 2025 18:349,230103,970,79272,575,0004,031,0002,387,968
7Mar 2, 2025 18:349,236107,074,59371,615,0005,043,0002,416,640
8Mar 2, 2025 18:349,250110,280,16373,788,0002,991,0002,510,848
9Mar 2, 2025 18:349,32596,362,26974,384,0003,015,0002,400,256