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 28, 2024 23:47Hayden DonnellyHayden DonnellyScore: 65,335Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 28, 2024 23:4765,315563,165,418542,114,00002,281,472
2Nov 28, 2024 23:4765,322563,538,050541,175,0001,000,0002,269,184
3Nov 28, 2024 23:4765,323563,206,750542,178,00002,428,928
4Nov 28, 2024 23:4765,332566,985,732542,258,00002,531,328
5Nov 28, 2024 23:4765,335561,888,008542,284,00002,433,024
6Nov 28, 2024 23:4765,340568,465,975541,324,0001,000,0002,269,184
7Nov 28, 2024 23:4765,406571,880,245541,871,000999,0002,531,328
8Nov 28, 2024 23:4765,432563,379,969542,087,0001,000,0002,531,328
9Nov 28, 2024 23:4765,556566,389,209544,117,00002,433,024