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 11, 2025 02:13RyhbtRyhbtScore: 53,930Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2025 02:1353,851469,875,174443,964,0002,999,0002,281,472
2Aug 11, 2025 02:1353,875468,603,302445,163,0002,000,0002,265,088
3Aug 11, 2025 02:1353,894476,226,407446,324,0001,000,0002,277,376
4Aug 11, 2025 02:1353,902468,339,093446,390,0001,000,0002,277,376
5Aug 11, 2025 02:1353,930480,674,032444,625,0002,997,0002,265,088
6Aug 11, 2025 02:1353,933478,114,975444,647,0002,997,0002,265,088
7Aug 11, 2025 02:1353,933480,040,819445,642,0001,998,0002,527,232
8Aug 11, 2025 02:1353,952475,114,011444,802,0002,998,0002,281,472
9Aug 11, 2025 02:1353,958471,175,095445,849,0001,999,0002,269,184