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 31, 2025 21:30Adam FolwarcznyAdam FolwarcznyScore: 11,007Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2025 21:3010,901115,808,84775,401,00015,080,0002,273,280
2Aug 31, 2025 21:3010,937116,748,52472,820,00017,955,0002,330,624
3Aug 31, 2025 21:3010,940112,656,69272,843,00017,961,0002,535,424
4Aug 31, 2025 21:3011,007112,306,54177,300,00014,054,0002,392,064
5Aug 31, 2025 21:3011,021114,419,08281,420,00010,051,0002,269,184
6Aug 31, 2025 21:3011,065120,567,64076,868,00014,974,0002,281,472