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 listAug 5, 2025 03:11Drew GarciaDrew GarciaScore: 47,963Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 5, 2025 03:1147,581423,592,314392,921,0001,999,0002,273,280
2Aug 5, 2025 03:1147,634427,774,935394,364,000998,0002,273,280
3Aug 5, 2025 03:1147,941419,232,388395,911,0001,999,0002,400,256
4Aug 5, 2025 03:1147,956421,296,698396,036,0002,000,0002,273,280
5Aug 5, 2025 03:1147,963421,848,132397,090,0001,000,0002,404,352
6Aug 5, 2025 03:1147,976422,403,848397,203,0001,000,0002,273,280
7Aug 5, 2025 03:1147,977423,900,747397,212,0001,000,0002,387,968
8Aug 5, 2025 03:1147,996424,916,804397,368,0001,000,0002,273,280
9Aug 5, 2025 03:1147,997427,049,078397,379,000998,0002,273,280