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 listMar 1, 2025 23:28PhibPhibScore: 42,558Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 1, 2025 23:2842,528381,364,556350,980,0001,999,0002,502,656
2Mar 1, 2025 23:2842,530380,256,508353,002,00002,281,472
3Mar 1, 2025 23:2842,538376,167,538351,063,0002,000,0002,510,848
4Mar 1, 2025 23:2842,552380,630,232351,178,0002,001,0002,281,472
5Mar 1, 2025 23:2842,558376,040,656351,230,0002,001,0002,510,848
6Mar 1, 2025 23:2842,559379,755,816350,237,0003,002,0002,502,656
7Mar 1, 2025 23:2842,563377,306,697351,270,0002,001,0002,338,816
8Mar 1, 2025 23:2842,564375,057,409350,279,0003,002,0002,281,472
9Mar 1, 2025 23:2842,565375,903,551352,289,0001,000,0002,281,472