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 15, 2026 08:17timothygktimothygkScore: 102,453Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 08:17101,916856,469,647621,412,000224,496,0002,113,536
2Oct 15, 2026 08:17102,118858,676,204621,433,000226,147,0002,113,536
3Oct 15, 2026 08:17102,157859,691,325622,043,000225,867,0002,113,536
4Oct 15, 2026 08:17102,282859,573,587621,667,000227,278,0002,113,536
5Oct 15, 2026 08:17102,453860,786,942621,416,000228,946,0002,113,536
6Oct 15, 2026 08:17102,552861,753,085621,848,000229,334,0002,113,536
7Oct 15, 2026 08:17102,570862,193,226621,566,000229,765,0002,113,536
8Oct 15, 2026 08:17102,646862,437,712622,568,000229,400,0002,113,536
9Oct 15, 2026 08:17103,196867,186,943621,940,000234,587,0002,113,536