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 2, 2025 12:23Marco BarboneMarco BarboneScore: 53,118Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2025 12:2352,777462,152,938437,052,0001,000,0002,289,664
2Aug 2, 2025 12:2352,825471,011,600437,443,0001,001,0002,289,664
3Aug 2, 2025 12:2353,042465,512,473439,246,0001,000,0002,273,280
4Aug 2, 2025 12:2353,050462,804,405439,314,0001,000,0002,289,664
5Aug 2, 2025 12:2353,118465,563,527438,879,0001,999,0002,289,664
6Aug 2, 2025 12:2353,137463,044,235439,036,0002,000,0002,289,664
7Aug 2, 2025 12:2353,185473,389,287441,439,00002,289,664
8Aug 2, 2025 12:2353,193470,130,815440,498,0001,001,0002,269,184
9Aug 2, 2025 12:2353,205468,683,355439,606,0001,998,0002,269,184