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:06Drew GarciaDrew GarciaScore: 53,796Success
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:0653,521469,948,781427,220,00017,008,0002,310,144
2Aug 5, 2025 03:0653,547469,685,596431,424,00013,012,0002,306,048
3Aug 5, 2025 03:0653,559466,851,443431,551,00012,986,0002,285,568
4Aug 5, 2025 03:0653,782474,319,602422,369,00024,021,0002,428,928
5Aug 5, 2025 03:0653,796475,898,729433,520,00012,985,0002,310,144
6Aug 5, 2025 03:0653,801472,510,064427,566,00018,980,0002,408,448
7Aug 5, 2025 03:0653,839468,124,929428,867,00017,994,0002,310,144
8Aug 5, 2025 03:0653,877471,574,876432,171,00015,005,0002,310,144
9Aug 5, 2025 03:0653,974470,304,016432,989,00014,999,0002,310,144