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 listOct 20, 2024 17:14Vladimir TatVladimir TatScore: 60,162Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 20, 2024 17:1460,115520,561,473496,958,0001,999,0002,277,376
2Oct 20, 2024 17:1460,119521,574,491496,990,0001,999,0002,289,664
3Oct 20, 2024 17:1460,121520,462,258497,008,0002,000,0002,281,472
4Oct 20, 2024 17:1460,140524,965,827497,158,0002,000,0002,289,664
5Oct 20, 2024 17:1460,162526,008,848498,346,0001,000,0002,281,472
6Oct 20, 2024 17:1460,163535,522,937498,353,0001,000,0002,289,664
7Oct 20, 2024 17:1460,168525,233,347499,397,00002,289,664
8Oct 20, 2024 17:1460,233521,572,462497,937,0001,999,0002,281,472
9Oct 20, 2024 17:1460,270526,387,807499,237,0001,000,0002,289,664