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 15, 2025 22:39k1k1Score: 487,518Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 15, 2025 22:39482,1584,029,301,3863,938,945,00062,967,0002,289,664
2Apr 15, 2025 22:39482,8534,035,226,8713,945,714,00061,964,0002,277,376
3Apr 15, 2025 22:39486,0554,062,380,6723,973,287,00060,973,0002,277,376
4Apr 15, 2025 22:39487,1904,067,368,6793,960,725,00082,952,0002,277,376
5Apr 15, 2025 22:39487,5184,072,278,7583,980,429,00065,973,0002,289,664
6Apr 15, 2025 22:39487,9074,080,137,3453,980,671,00068,959,0002,277,376
7Apr 15, 2025 22:39488,4454,079,318,3583,980,129,00073,965,0002,277,376
8Apr 15, 2025 22:39489,2134,090,913,6833,986,492,00073,972,0002,289,664
9Apr 15, 2025 22:39509,4484,261,351,7804,169,441,00058,977,0002,289,664