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 listNov 30, 2025 07:16Jeffrey JianJeffrey JianScore: 64,861Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 30, 2025 07:1664,838562,038,691538,159,00002,510,848
2Nov 30, 2025 07:1664,847560,815,020537,227,0001,000,0002,260,992
3Nov 30, 2025 07:1664,847561,985,749538,229,00002,527,232
4Nov 30, 2025 07:1664,851562,133,270536,267,0002,000,0002,519,040
5Nov 30, 2025 07:1664,861563,034,636537,343,0001,000,0002,387,968
6Nov 30, 2025 07:1664,868563,732,624538,408,00002,510,848
7Nov 30, 2025 07:1664,873564,435,901536,446,0002,001,0002,519,040
8Nov 30, 2025 07:1664,876565,795,990537,475,000999,0002,260,992
9Nov 30, 2025 07:1664,893564,755,543536,611,0001,998,0002,519,040